{"id":"https://openalex.org/W1712180277","doi":"https://doi.org/10.1007/3-540-40996-3_12","title":"On Approximating Minimum Vertex Cover for Graphs with Perfect Matching","display_name":"On Approximating Minimum Vertex Cover for Graphs with Perfect Matching","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1712180277","doi":"https://doi.org/10.1007/3-540-40996-3_12","mag":"1712180277"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-40996-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-40996-3_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I2801613365","display_name":"Mitchell Institute","ror":"https://ror.org/03ds72003","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2801613365"]},{"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"]},{"id":"https://openalex.org/I1311060795","display_name":"U.S. National Science Foundation","ror":"https://ror.org/021nxhr62","country_code":"US","type":"funder","lineage":["https://openalex.org/I1311060795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, 77843-3112, Texas, USA","USA National Science Foundation, Texas, USA","USA National Science Foundation","Texas A&M University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, 77843-3112, Texas, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"USA National Science Foundation, Texas, USA","institution_ids":["https://openalex.org/I1311060795"]},{"raw_affiliation_string":"USA National Science Foundation","institution_ids":["https://openalex.org/I1311060795"]},{"raw_affiliation_string":"Texas A&M University","institution_ids":["https://openalex.org/I2801613365","https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"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"]},{"id":"https://openalex.org/I2801613365","display_name":"Mitchell Institute","ror":"https://ror.org/03ds72003","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2801613365"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad A. Kanj","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, 77843-3112, Texas, USA","Texas A&M University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, 77843-3112, Texas, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Texas A&M University","institution_ids":["https://openalex.org/I2801613365","https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023394727"],"corresponding_institution_ids":["https://openalex.org/I1311060795","https://openalex.org/I2801613365","https://openalex.org/I91045830"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4479,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.68056008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9991999864578247,"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.9306536912918091},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7518335580825806},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.687976062297821},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6390388011932373},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6006878018379211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5975415706634521},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5108077526092529},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47769004106521606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47659391164779663},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4356686770915985},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4201608896255493},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3941419720649719},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36608389019966125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2808834910392761}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9306536912918091},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7518335580825806},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.687976062297821},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6390388011932373},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6006878018379211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5975415706634521},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5108077526092529},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47769004106521606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47659391164779663},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4356686770915985},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4201608896255493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3941419720649719},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36608389019966125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2808834910392761},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-40996-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-40996-3_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.37.1935","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tamu.edu/people/iakanj/vcapx.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.7360","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.7360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://facweb.cs.depaul.edu/ikanj/papers/Latex/VC-APX/tcs/Revised_VC-APX.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W168093571","https://openalex.org/W1572977974","https://openalex.org/W1712180277","https://openalex.org/W1963511606","https://openalex.org/W1990313671","https://openalex.org/W2003665833","https://openalex.org/W2003813631","https://openalex.org/W2011039300","https://openalex.org/W2013415302","https://openalex.org/W2022712087","https://openalex.org/W2030087828","https://openalex.org/W2041605864","https://openalex.org/W2053079614","https://openalex.org/W2077783414","https://openalex.org/W2087226760","https://openalex.org/W2109039359","https://openalex.org/W2137373403","https://openalex.org/W4241764762","https://openalex.org/W4285719527","https://openalex.org/W7026635939"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W2544075308","https://openalex.org/W2079263399","https://openalex.org/W1558145674","https://openalex.org/W1502186998","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2125212169"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}