{"id":"https://openalex.org/W2172398637","doi":"https://doi.org/10.1007/978-3-642-36065-7_14","title":"Approximation Algorithms for the Partition Vertex Cover Problem","display_name":"Approximation Algorithms for the Partition Vertex Cover Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2172398637","doi":"https://doi.org/10.1007/978-3-642-36065-7_14","mag":"2172398637"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-36065-7_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36065-7_14","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/A5061198219","display_name":"Suman K. Bera","orcid":"https://orcid.org/0000-0002-5699-2948"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Suman Kalyan Bera","raw_affiliation_strings":["IBM India Research Lab, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"IBM India Research Lab, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000180821","display_name":"Shalmoli Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shalmoli Gupta","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["Indian Institute of Technology Delhi, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110192164","display_name":"Sambuddha Roy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sambuddha Roy","raw_affiliation_strings":["IBM India Research Lab, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"IBM India Research Lab, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5061198219"],"corresponding_institution_ids":["https://openalex.org/I4210103279"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.823,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74268196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"137","last_page":"145"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7659520506858826},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7293053865432739},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.7227869629859924},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7079541087150574},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6695758104324341},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.632790207862854},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.584605872631073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5637166500091553},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4830816090106964},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.47914546728134155},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4766993224620819},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4690556824207306},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4679478704929352},{"id":"https://openalex.org/keywords/partition-function","display_name":"Partition function (quantum field theory)","score":0.4649929106235504},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45867663621902466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44776564836502075},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4326810836791992},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.41418665647506714},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.41382595896720886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32886719703674316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3172151446342468},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.23772555589675903},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22251200675964355},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.18151569366455078},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06720873713493347}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7659520506858826},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7293053865432739},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.7227869629859924},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7079541087150574},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6695758104324341},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.632790207862854},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.584605872631073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5637166500091553},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4830816090106964},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.47914546728134155},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4766993224620819},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4690556824207306},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4679478704929352},{"id":"https://openalex.org/C2778401447","wikidata":"https://www.wikidata.org/wiki/Q7140637","display_name":"Partition function (quantum field theory)","level":2,"score":0.4649929106235504},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45867663621902466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44776564836502075},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4326810836791992},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.41418665647506714},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.41382595896720886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32886719703674316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3172151446342468},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.23772555589675903},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22251200675964355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.18151569366455078},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06720873713493347},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-36065-7_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36065-7_14","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"}],"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/W1485007464","https://openalex.org/W1502199009","https://openalex.org/W1506934790","https://openalex.org/W1531390321","https://openalex.org/W1899379166","https://openalex.org/W1981351071","https://openalex.org/W1984628625","https://openalex.org/W1990313671","https://openalex.org/W2003719999","https://openalex.org/W2013355418","https://openalex.org/W2015706819","https://openalex.org/W2038190710","https://openalex.org/W2046977354","https://openalex.org/W2048974928","https://openalex.org/W2064600658","https://openalex.org/W2094067695","https://openalex.org/W2126448893","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2155148197","https://openalex.org/W2157300207","https://openalex.org/W2178856181","https://openalex.org/W2611804663","https://openalex.org/W4205585032","https://openalex.org/W4247051268","https://openalex.org/W4254780343","https://openalex.org/W7026635939"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W1966805076","https://openalex.org/W2063671489","https://openalex.org/W1502438505","https://openalex.org/W2572017251","https://openalex.org/W2077783414","https://openalex.org/W2883403047","https://openalex.org/W2766826477"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}