{"id":"https://openalex.org/W2477603932","doi":"https://doi.org/10.1137/1.9781611973402.124","title":"Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs","display_name":"Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs","publication_year":2013,"publication_date":"2013-12-18","ids":{"openalex":"https://openalex.org/W2477603932","doi":"https://doi.org/10.1137/1.9781611973402.124","mag":"2477603932"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973402.124","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973402.124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"article","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/A5010450673","display_name":"Wang Chi Cheung","orcid":"https://orcid.org/0000-0001-9380-5673"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wang Chi Cheung","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112864313","display_name":"Michel X. Goemans","orcid":null},"institutions":[{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Michel X. Goemans","raw_affiliation_strings":["STAR (Agency for Science, Technology And Research, Singapore"],"affiliations":[{"raw_affiliation_string":"STAR (Agency for Science, Technology And Research, Singapore","institution_ids":["https://openalex.org/I115228651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103373639","display_name":"Sam Chiu-wai Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Sam Chiu-Wai Wong","raw_affiliation_strings":["STAR (Agency for Science, Technology And Research, Singapore"],"affiliations":[{"raw_affiliation_string":"STAR (Agency for Science, Technology And Research, Singapore","institution_ids":["https://openalex.org/I115228651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010450673"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7005,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81816765,"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":"1714","last_page":"1726"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.998199999332428,"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.6693171262741089},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.590113639831543},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5852870345115662},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5814493298530579},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49038076400756836},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4748544692993164},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.450607031583786},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3462347090244293},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3340323567390442},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25263893604278564},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07779529690742493}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6693171262741089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.590113639831543},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5852870345115662},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5814493298530579},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49038076400756836},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4748544692993164},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.450607031583786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3462347090244293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3340323567390442},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25263893604278564},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07779529690742493},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973402.124","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973402.124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1378150017","display_name":null,"funder_award_id":"CCF-1115849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8281068745","display_name":null,"funder_award_id":"1115849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1840962598","https://openalex.org/W2015706819","https://openalex.org/W2029933769","https://openalex.org/W2044726653","https://openalex.org/W2064600658","https://openalex.org/W2089074354","https://openalex.org/W2112112676","https://openalex.org/W2126448893","https://openalex.org/W4229659716"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2094388041","https://openalex.org/W3102280101","https://openalex.org/W2538178083","https://openalex.org/W159504299","https://openalex.org/W1968988491"],"abstract_inverted_index":{"In":[0,150,164,202,265],"this":[1,151],"paper,":[2,152],"we":[3,75,153,224,267],"consider":[4,225],"the":[5,23,40,55,68,83,92,144,147,165,176,182,206,209,226,262],"minimum":[6],"unweighted":[7,70,80],"Vertex":[8],"Cover":[9],"problem":[10,66,116,229],"with":[11,257],"Hard":[12],"Capacity":[13],"constraints":[14,41],"(VCHC)":[15],"on":[16,111,196,213,249,253,279],"multigraphs":[17,112],"and":[18,54,100,113,123,133,160],"hypergraphs.":[19,114],"Given":[20],"a":[21,30,48,129,134,191,215,243,258,269],"graph,":[22],"objective":[24],"of":[25,33,51,57,60,86,146,167,179,190],"VCHC":[26,87,110,228,248,252,278],"is":[27,63,88,143,172],"to":[28,79,159,175,235,251],"find":[29],"smallest":[31],"multiset":[32],"vertices":[34],"that":[35,42],"cover":[36,47,72,94,185,236],"all":[37,237],"edges,":[38,53],"under":[39],"each":[43,61,194],"vertex":[44,62,71,184],"can":[45],"only":[46,233],"limited":[49],"number":[50,56],"incident":[52],"available":[58],"copies":[59],"bounded.":[64],"This":[65,115],"generalizes":[67],"classical":[69,183],"problem.":[73,186],"Here":[74],"restrict":[76],"our":[77,169],"attention":[78],"instances,":[81],"since":[82],"weighted":[84],"version":[85],"as":[89,91,96],"hard":[90],"set":[93],"problem,":[95],"shown":[97],"by":[98,121],"Chuzhoy":[99],"Naor":[101],"(FOCS":[102],"2002).":[103],"We":[104,241],"obtain":[105],"improved":[106],"approximation":[107,157,170,263],"algorithms":[108,188],"for":[109,131,139,181,204,276],"has":[117],"first":[118],"been":[119],"studied":[120],"Saha":[122],"Khuller":[124],"(ICALP":[125],"2012).":[126],"They":[127],"proposed":[128],"38-approximation":[130],"multigraphs,":[132,168,205],"max":[135],"{6":[136],"f,":[137],"65}-approximation":[138],"hypergraphs,":[140],"where":[141],"f":[142,162],"size":[145],"largest":[148],"hyperedge.":[149],"significantly":[154],"improve":[155],"these":[156],"ratios":[158],"2":[161,180],"respectively.":[163],"case":[166],"ratio":[171],"very":[173],"close":[174],"longstanding":[177],"bound":[178],"Our":[187],"consist":[189],"two-step":[192],"process,":[193],"based":[195],"rounding":[197],"an":[198],"appropriate":[199],"linear":[200],"program.":[201],"particular,":[203,266],"analysis":[207],"in":[208,230,261],"second":[210],"step":[211],"relies":[212],"identifying":[214],"matching":[216],"structure":[217],"within":[218],"any":[219],"extreme":[220],"point":[221],"solution.":[222],"Furthermore,":[223],"partial":[227,247,277],"which":[231],"one":[232],"needs":[234],"but":[238],"\u2113":[239],"edges.":[240],"propose":[242],"generic":[244],"reduction":[245],"from":[246],"f-hypergraphs":[250],"(f":[254],"+":[255,271,273],"1)-hypergraphs,":[256],"small":[259],"loss":[260],"factor.":[264],"present":[268],"(2f":[270],"2)(1":[272],"\u220a)-approximation":[274],"algorithm":[275],"f-hypergraphs.":[280]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}