{"id":"https://openalex.org/W1558145674","doi":"https://doi.org/10.1007/3-540-45061-0_15","title":"An Improved Approximation Algorithm for Vertex Cover with Hard Capacities","display_name":"An Improved Approximation Algorithm for Vertex Cover with Hard Capacities","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1558145674","doi":"https://doi.org/10.1007/3-540-45061-0_15","mag":"1558145674"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45061-0_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45061-0_15","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":"conference-paper","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/A5015765462","display_name":"Rajiv Gandhi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Gandhi","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050273239","display_name":"Eran Halperin","orcid":"https://orcid.org/0000-0002-2373-3691"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eran Halperin","raw_affiliation_strings":["Computer Science Division, University of California, Berkeley, CA, 94720","International Computer Science Institute, Berkeley, CA, 94704"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Division, University of California, Berkeley, CA, 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, 94704","institution_ids":["https://openalex.org/I1297971548"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Camden, NJ, 08102"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Camden, NJ, 08102","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8236,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.84665793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"164","last_page":"175"},"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.9994000196456909,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9950000047683716,"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.950549840927124},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.8664581775665283},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6635171175003052},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6536605954170227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6493313312530518},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6411507725715637},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.6242179274559021},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5594846606254578},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5362659692764282},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.49732401967048645},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46554526686668396},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4197394847869873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4098619222640991},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3736213743686676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3542037606239319},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3214641809463501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23791071772575378}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.950549840927124},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.8664581775665283},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6635171175003052},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6536605954170227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6493313312530518},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6411507725715637},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6242179274559021},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5594846606254578},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5362659692764282},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.49732401967048645},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46554526686668396},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4197394847869873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4098619222640991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3736213743686676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3542037606239319},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3214641809463501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23791071772575378},{"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/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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-45061-0_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45061-0_15","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.110.1459","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.1459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~srin/PS/2006/hardcap-jou.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.4531","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.4531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/vcload/nabs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.139.6262","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.6262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~rajivg/publications/journal/jcss06.ps","raw_type":"text"},{"id":"pmh:oai:drum.lib.umd.edu:1903/1272","is_oa":false,"landing_page_url":"http://hdl.handle.net/1903/1272","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W117318854","https://openalex.org/W1572977974","https://openalex.org/W1971749164","https://openalex.org/W1973509127","https://openalex.org/W1984628625","https://openalex.org/W1990313671","https://openalex.org/W2029828838","https://openalex.org/W2040924621","https://openalex.org/W2046554800","https://openalex.org/W2053079614","https://openalex.org/W2073127061","https://openalex.org/W2087937221","https://openalex.org/W2088188524","https://openalex.org/W2089074354","https://openalex.org/W2108073487","https://openalex.org/W2109533535","https://openalex.org/W2144416612","https://openalex.org/W2144926522","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2611804663","https://openalex.org/W4241764762","https://openalex.org/W6672819393"],"related_works":["https://openalex.org/W2112112676","https://openalex.org/W2108073487","https://openalex.org/W2551034790","https://openalex.org/W2063671489","https://openalex.org/W2029933769","https://openalex.org/W2044818254","https://openalex.org/W1558145674","https://openalex.org/W2116388786","https://openalex.org/W2015706819","https://openalex.org/W2077783414"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}