{"id":"https://openalex.org/W1978936478","doi":"https://doi.org/10.1145/1435375.1435383","title":"Combinatorial dominance guarantees for problems with infeasible solutions","display_name":"Combinatorial dominance guarantees for problems with infeasible solutions","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W1978936478","doi":"https://doi.org/10.1145/1435375.1435383","mag":"1978936478"},"language":"en","primary_location":{"id":"doi:10.1145/1435375.1435383","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1435375.1435383","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5067369330","display_name":"Daniel Berend","orcid":"https://orcid.org/0000-0002-5756-5921"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Daniel Berend","raw_affiliation_strings":["Ben-Gurion University, Beer Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060741187","display_name":"Steven Skiena","orcid":"https://orcid.org/0000-0003-0397-7514"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven S. Skiena","raw_affiliation_strings":["Stony Brook University, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, NY","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061124415","display_name":"Yochai Twitto","orcid":"https://orcid.org/0000-0002-2764-3642"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yochai Twitto","raw_affiliation_strings":["Ben-Gurion University, Beer Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4081,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.65184855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"29"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/heuristics","display_name":"Heuristics","score":0.8047484159469604},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.604362428188324},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.576231837272644},{"id":"https://openalex.org/keywords/dominance","display_name":"Dominance (genetics)","score":0.5376248359680176},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5305322408676147},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5110191106796265},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5105908513069153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48362910747528076},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45619824528694153},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4561741352081299},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4428313374519348},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44243863224983215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4307393431663513},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.41962170600891113},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3559008240699768},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08602231740951538},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08293893933296204}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8047484159469604},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.604362428188324},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.576231837272644},{"id":"https://openalex.org/C151913843","wikidata":"https://www.wikidata.org/wiki/Q3454555","display_name":"Dominance (genetics)","level":3,"score":0.5376248359680176},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5305322408676147},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5110191106796265},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5105908513069153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48362910747528076},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45619824528694153},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4561741352081299},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4428313374519348},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44243863224983215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4307393431663513},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.41962170600891113},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3559008240699768},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08602231740951538},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08293893933296204},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1435375.1435383","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1435375.1435383","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"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/W125872373","https://openalex.org/W1601856531","https://openalex.org/W1968492936","https://openalex.org/W2006912660","https://openalex.org/W2026891055","https://openalex.org/W2027528755","https://openalex.org/W2027764232","https://openalex.org/W2072269936","https://openalex.org/W2084173720","https://openalex.org/W2086942674","https://openalex.org/W2087567316","https://openalex.org/W2092292680","https://openalex.org/W2092501917","https://openalex.org/W2092509105","https://openalex.org/W2100008268","https://openalex.org/W2202947145","https://openalex.org/W2237467837","https://openalex.org/W2561675875","https://openalex.org/W2912182072","https://openalex.org/W3007698439","https://openalex.org/W4211213739"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W41549461","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4286853492","https://openalex.org/W4296116869","https://openalex.org/W3215145351"],"abstract_inverted_index":{"The":[0],"design":[1],"and":[2,82,85,94],"analysis":[3,78],"of":[4,21,31,43,79,107,115,132],"approximation":[5,46],"algorithms":[6],"for":[7,39,90,130],"NP":[8],"-hard":[9],"problems":[10,93,134],"is":[11,55],"perhaps":[12],"the":[13,19,29,41,59,103,133],"most":[14,131],"active":[15],"research":[16],"area":[17],"in":[18],"theory":[20],"combinatorial":[22,33,112],"algorithms.":[23,97],"In":[24],"this":[25],"article,":[26],"we":[27,100,135],"study":[28],"notion":[30],"a":[32,37,44,56,63,111],"dominance":[34,53,87,113],"guarantee":[35,57,114],"as":[36],"way":[38],"assessing":[40],"performance":[42],"given":[45],"algorithm.":[47],"An":[48],"f":[49,70],"(":[50,71],"n":[51,72,117,123],")":[52,73],"bound":[54],"that":[58,102],"heuristic":[60,95,106],"always":[61],"returns":[62],"solution":[64],"not":[65],"worse":[66],"than":[67],"at":[68],"least":[69],"solutions.":[74],"We":[75,125],"give":[76,127],"tight":[77],"many":[80],"heuristics,":[81],"establish":[83],"novel":[84],"interesting":[86],"guarantees":[88],"even":[89],"certain":[91],"inapproximable":[92],"search":[96],"For":[98],"example,":[99],"show":[101],"maximal":[104],"matching":[105],"VERTEX":[108],"COVER":[109],"offers":[110],"2":[116],"\u2212":[118],"(1.839":[119],"+":[120],"o":[121],"(1))":[122],".":[124],"also":[126],"inapproximability":[128],"results":[129],"discuss.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}