{"id":"https://openalex.org/W2794671365","doi":"https://doi.org/10.7151/dmgt.2060","title":"An efficient polynomial time approximation scheme for the vertex cover P_ 3 problem on planar graphs","display_name":"An efficient polynomial time approximation scheme for the vertex cover P_ 3 problem on planar graphs","publication_year":2018,"publication_date":"2018-03-28","ids":{"openalex":"https://openalex.org/W2794671365","doi":"https://doi.org/10.7151/dmgt.2060","mag":"2794671365"},"language":"en","primary_location":{"id":"doi:10.7151/dmgt.2060","is_oa":true,"landing_page_url":"https://doi.org/10.7151/dmgt.2060","pdf_url":"https://doi.org/10.7151/dmgt.2060","source":{"id":"https://openalex.org/S2738357781","display_name":"Discussiones Mathematicae Graph Theory","issn_l":"1234-3099","issn":["1234-3099","2083-5892"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discussiones Mathematicae Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7151/dmgt.2060","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062762366","display_name":"Yongtang Shi","orcid":"https://orcid.org/0000-0001-9406-7967"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]},{"id":"https://openalex.org/I75390827","display_name":"Beijing University of Chemical Technology","ror":"https://ror.org/00df5yc52","country_code":"CN","type":"education","lineage":["https://openalex.org/I75390827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yongtang Shi","raw_affiliation_strings":["School of Science Beijing University of Chemical Technology Beijing 100029, China","Nankai University Tianjin 300071, China","Center for Combinatorics and LPMC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science Beijing University of Chemical Technology Beijing 100029, China","institution_ids":["https://openalex.org/I75390827"]},{"raw_affiliation_string":"Nankai University Tianjin 300071, China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"Center for Combinatorics and LPMC","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101728553","display_name":"Jianhua Tu","orcid":"https://orcid.org/0000-0002-7667-2116"},"institutions":[{"id":"https://openalex.org/I75390827","display_name":"Beijing University of Chemical Technology","ror":"https://ror.org/00df5yc52","country_code":"CN","type":"education","lineage":["https://openalex.org/I75390827"]},{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianhua Tu","raw_affiliation_strings":["Nankai University Tianjin 300071, China","Center for Combinatorics and LPMC","School of Science Beijing University of Chemical Technology Beijing 100029, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nankai University Tianjin 300071, China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"Center for Combinatorics and LPMC","institution_ids":[]},{"raw_affiliation_string":"School of Science Beijing University of Chemical Technology Beijing 100029, China","institution_ids":["https://openalex.org/I75390827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062762366"],"corresponding_institution_ids":["https://openalex.org/I205237279","https://openalex.org/I75390827"],"apc_list":null,"apc_paid":null,"fwci":0.6448,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.70664865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"1","first_page":"55","last_page":"55"},"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.9976999759674072,"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/mathematics","display_name":"Mathematics","score":0.85528963804245},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.809941291809082},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.700518012046814},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5849652290344238},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5651906728744507},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5378270745277405},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.48435649275779724},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4743565320968628},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4495026171207428},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4331165552139282},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.42173928022384644},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.4157170057296753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38636884093284607},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3734104633331299},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3205583095550537},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3013032078742981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06877252459526062}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.85528963804245},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.809941291809082},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.700518012046814},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5849652290344238},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5651906728744507},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5378270745277405},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.48435649275779724},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4743565320968628},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4495026171207428},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4331165552139282},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.42173928022384644},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.4157170057296753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38636884093284607},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3734104633331299},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3205583095550537},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3013032078742981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06877252459526062},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7151/dmgt.2060","is_oa":true,"landing_page_url":"https://doi.org/10.7151/dmgt.2060","pdf_url":"https://doi.org/10.7151/dmgt.2060","source":{"id":"https://openalex.org/S2738357781","display_name":"Discussiones Mathematicae Graph Theory","issn_l":"1234-3099","issn":["1234-3099","2083-5892"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discussiones Mathematicae Graph Theory","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5b4b067dae5c4fe2a229b36524eccdb7","is_oa":false,"landing_page_url":"https://doaj.org/article/5b4b067dae5c4fe2a229b36524eccdb7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 55-65 (2019)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.7151/dmgt.2060","is_oa":true,"landing_page_url":"https://doi.org/10.7151/dmgt.2060","pdf_url":"https://doi.org/10.7151/dmgt.2060","source":{"id":"https://openalex.org/S2738357781","display_name":"Discussiones Mathematicae Graph Theory","issn_l":"1234-3099","issn":["1234-3099","2083-5892"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discussiones Mathematicae Graph Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2794671365.pdf","grobid_xml":"https://content.openalex.org/works/W2794671365.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W94353364","https://openalex.org/W1511846875","https://openalex.org/W1554668720","https://openalex.org/W1669562806","https://openalex.org/W1968635621","https://openalex.org/W1971497628","https://openalex.org/W1987796300","https://openalex.org/W2007069176","https://openalex.org/W2007945292","https://openalex.org/W2034112762","https://openalex.org/W2038643780","https://openalex.org/W2047871605","https://openalex.org/W2048794017","https://openalex.org/W2050952499","https://openalex.org/W2052227003","https://openalex.org/W2052790720","https://openalex.org/W2052812513","https://openalex.org/W2070576097","https://openalex.org/W2120977156","https://openalex.org/W2137986027","https://openalex.org/W2141925838","https://openalex.org/W2156760067","https://openalex.org/W2199703934","https://openalex.org/W2218434618","https://openalex.org/W2264404578","https://openalex.org/W2412257713","https://openalex.org/W2555985695","https://openalex.org/W4232845306","https://openalex.org/W4238913085","https://openalex.org/W4300303686"],"related_works":["https://openalex.org/W2036594069","https://openalex.org/W2156896570","https://openalex.org/W1548167816","https://openalex.org/W2386614357","https://openalex.org/W3023249572","https://openalex.org/W1554742795","https://openalex.org/W1890004479","https://openalex.org/W1599092334","https://openalex.org/W2180429000","https://openalex.org/W2417586110"],"abstract_inverted_index":{"Given":[0],"a":[1,23,70],"graph":[2],"G":[3,38],"=":[4],"(V,":[5],"E),":[6],"the":[7,10,75,86,91,108],"task":[8],"in":[9,37,55,62],"vertex":[11,43],"cover":[12],"P":[13],"3":[14,17,36,50,78,111],"(V":[15],"CP":[16,49,77,110],")":[18],"problem":[19,51,79,112],"is":[20],"to":[21,73],"find":[22],"minimum":[24],"subset":[25],"of":[26,34,82],"vertices":[27],"F":[28,45],"V":[29,48,76,109],"such":[30],"that":[31],"every":[32],"path":[33],"order":[35],"contains":[39],"at":[40],"least":[41],"one":[42],"from":[44],".":[46],"The":[47],"remains":[52],"NP-hard":[53,96],"even":[54],"planar":[56,114],"graphs":[57,81],"and":[58,90],"has":[59],"many":[60],"applications":[61],"real":[63],"world.":[64],"In":[65],"this":[66],"paper,":[67],"we":[68,98],"give":[69],"dynamic-programming":[71],"algorithm":[72,89],"solve":[74],"on":[80,113],"bounded":[83],"branchwidth.":[84],"Using":[85],"dynamic":[87],"programming":[88],"Baker's":[92],"EPTAS":[93],"framework":[94],"for":[95,107],"problems,":[97],"present":[99],"an":[100],"efficient":[101],"polynomial":[102],"time":[103],"approximation":[104],"scheme":[105],"(EPTAS)":[106],"graphs.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2018-04-06T00:00:00"}