{"id":"https://openalex.org/W1554742795","doi":"https://doi.org/10.1007/978-0-387-34735-6_24","title":"On PTAS for Planar Graph Problems","display_name":"On PTAS for Planar Graph Problems","publication_year":2006,"publication_date":"2006-12-14","ids":{"openalex":"https://openalex.org/W1554742795","doi":"https://doi.org/10.1007/978-0-387-34735-6_24","mag":"1554742795"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-34735-6_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-34735-6_24","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021456840","display_name":"Xiuzhen Huang","orcid":"https://orcid.org/0000-0003-0498-3131"},"institutions":[{"id":"https://openalex.org/I125956826","display_name":"Arkansas State University","ror":"https://ror.org/006pyvd89","country_code":"US","type":"education","lineage":["https://openalex.org/I125956826"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiuzhen Huang","raw_affiliation_strings":["Department of Computer Science, Arkansas State University, State University, Arkansas, 72467"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Arkansas State University, State University, Arkansas, 72467","institution_ids":["https://openalex.org/I125956826"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX, 77843"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX, 77843","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021456840"],"corresponding_institution_ids":["https://openalex.org/I125956826"],"apc_list":null,"apc_paid":null,"fwci":0.4184,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61845286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"313"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8416805863380432},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7690133452415466},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7268025875091553},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7146756649017334},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6289397478103638},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6174491047859192},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.6119976043701172},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.6108348369598389},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6080491542816162},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5770056843757629},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5134773850440979},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4958697259426117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4365270435810089},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43098652362823486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41504353284835815},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.21052098274230957},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1781415343284607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12125512957572937},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06658631563186646}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8416805863380432},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7690133452415466},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7268025875091553},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7146756649017334},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6289397478103638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6174491047859192},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.6119976043701172},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6108348369598389},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6080491542816162},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5770056843757629},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5134773850440979},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4958697259426117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4365270435810089},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43098652362823486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41504353284835815},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.21052098274230957},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1781415343284607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12125512957572937},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06658631563186646},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-34735-6_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-34735-6_24","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1557597301","https://openalex.org/W1972853793","https://openalex.org/W1982180670","https://openalex.org/W1983156760","https://openalex.org/W1987374783","https://openalex.org/W1987681136","https://openalex.org/W1995725694","https://openalex.org/W2000419386","https://openalex.org/W2011039300","https://openalex.org/W2013522700","https://openalex.org/W2026771935","https://openalex.org/W2027999353","https://openalex.org/W2038225707","https://openalex.org/W2043997666","https://openalex.org/W2048685245","https://openalex.org/W2067431706","https://openalex.org/W2074210283","https://openalex.org/W2092838574","https://openalex.org/W2108093643","https://openalex.org/W2137560895","https://openalex.org/W2144452581","https://openalex.org/W2144809360","https://openalex.org/W2156760067","https://openalex.org/W2798588639","https://openalex.org/W2913688336","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W2079263399","https://openalex.org/W1558145674","https://openalex.org/W2544075308","https://openalex.org/W1502186998","https://openalex.org/W3023249572","https://openalex.org/W1554742795","https://openalex.org/W1599092334"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}