{"id":"https://openalex.org/W1997900197","doi":"https://doi.org/10.1137/050636589","title":"Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets","display_name":"Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1997900197","doi":"https://doi.org/10.1137/050636589","mag":"1997900197"},"language":"en","primary_location":{"id":"doi:10.1137/050636589","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050636589","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5012490161","display_name":"Moshe Dror","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moshe Dror","raw_affiliation_strings":["Management Information Systems"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Management Information Systems","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6559,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.83527667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"21","issue":"4","first_page":"1019","last_page":"1034"},"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.9995999932289124,"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.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7928153276443481},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7640646696090698},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7389793395996094},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6146928668022156},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5876759886741638},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5483282208442688},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5278458595275879},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5187771320343018},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4967237114906311},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4956401586532593},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.45272472500801086},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4518933594226837},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4505881369113922},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.43549472093582153},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4338233470916748},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.42235642671585083},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.41857391595840454},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.41055548191070557},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.34811192750930786},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3245627284049988},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24690201878547668},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.21623647212982178},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15795046091079712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12672698497772217}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7928153276443481},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7640646696090698},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7389793395996094},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6146928668022156},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5876759886741638},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5483282208442688},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5278458595275879},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5187771320343018},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4967237114906311},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4956401586532593},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.45272472500801086},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4518933594226837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4505881369113922},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.43549472093582153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4338233470916748},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.42235642671585083},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.41857391595840454},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.41055548191070557},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.34811192750930786},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3245627284049988},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24690201878547668},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.21623647212982178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15795046091079712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12672698497772217},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/050636589","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050636589","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.3718","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jorlin.scripts.mit.edu/docs/publications/107-CombOptWith.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":37,"referenced_works":["https://openalex.org/W204341840","https://openalex.org/W1539551091","https://openalex.org/W1591506270","https://openalex.org/W1596142555","https://openalex.org/W1968143987","https://openalex.org/W1977545325","https://openalex.org/W1992370839","https://openalex.org/W1992490235","https://openalex.org/W1994248285","https://openalex.org/W2003159902","https://openalex.org/W2007279610","https://openalex.org/W2011039300","https://openalex.org/W2015101476","https://openalex.org/W2017996596","https://openalex.org/W2032789430","https://openalex.org/W2038225707","https://openalex.org/W2055569927","https://openalex.org/W2064284095","https://openalex.org/W2066194644","https://openalex.org/W2071016718","https://openalex.org/W2080182237","https://openalex.org/W2080379754","https://openalex.org/W2093221924","https://openalex.org/W2110367141","https://openalex.org/W2110824994","https://openalex.org/W2125690626","https://openalex.org/W2141355868","https://openalex.org/W2141791003","https://openalex.org/W2143391442","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2148590668","https://openalex.org/W2172255557","https://openalex.org/W2207378191","https://openalex.org/W2338905098","https://openalex.org/W3000633136","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2173431370","https://openalex.org/W2143410025","https://openalex.org/W1652157638","https://openalex.org/W2790735614","https://openalex.org/W2113943781","https://openalex.org/W2358533445","https://openalex.org/W2044818254","https://openalex.org/W1966805076","https://openalex.org/W2169416073","https://openalex.org/W1508327628"],"abstract_inverted_index":{"We":[0,90],"examine":[1],"a":[2,48,55,74,101,113,117],"selective":[3],"list":[4],"of":[5,24,44,54,62,76,100,119,135],"combinatorial":[6],"optimization":[7],"problems":[8,58,66,97],"in":[9,33,51],"NP":[10],"with":[11],"respect":[12],"to":[13],"inapproximability":[14,129],"(Arora":[15],"and":[16,67,84],"Lund":[17],"(1997))":[18],"given":[19],"that":[20,92],"the":[21,36,52,69,81,85,98,123,132],"ground":[22],"set":[23,37],"elements":[25],"N":[26,38,45],"has":[27],"additional":[28],"characteristics.":[29],"For":[30,122],"each":[31],"problem":[32,88],"this":[34],"paper,":[35],"is":[39,107],"expressed":[40],"explicitly":[41],"by":[42],"subsets":[43,133],"either":[46],"as":[47],"partition":[49],"or":[50],"form":[53],"cover.":[56],"The":[57],"examined":[59],"are":[60,134],"generalizations":[61],"well-known":[63],"classical":[64],"graph":[65],"include":[68],"minimal":[70],"spanning":[71],"tree":[72],"problem,":[73,83],"number":[75],"elementary":[77],"machine":[78],"scheduling":[79],"problems,":[80],"bin-packing":[82],"travelling":[86],"salesman":[87],"(TSP).":[89],"conclude":[91],"for":[93,116],"all":[94],"these":[95],"generalized":[96,124],"existence":[99],"polynomial":[102],"time":[103],"approximation":[104],"scheme":[105],"(PTAS)":[106],"impossible":[108],"unless":[109],"P=NP.":[110],"This":[111],"suggests":[112],"partial":[114],"characterization":[115],"family":[118],"inapproximable":[120],"problems.":[121],"Euclidean":[125],"TSP":[126],"we":[127],"prove":[128],"even":[130],"if":[131],"cardinality":[136],"2.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":28},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}