{"id":"https://openalex.org/W2170170950","doi":"https://doi.org/10.4086/toc.2006.v002a003","title":"","display_name":"","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2170170950","doi":"https://doi.org/10.4086/toc.2006.v002a003","mag":"2170170950"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2006.v002a003","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a003","pdf_url":"https://theoryofcomputing.org/articles/v002a003/v002a003.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v002a003/v002a003.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]},{"id":"https://openalex.org/I3019243323","display_name":"Center for Theoretical Physics","ror":"https://ror.org/04kfyt897","country_code":"PL","type":"facility","lineage":["https://openalex.org/I3019243323","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4210111960","display_name":"Centre de Physique Th\u00e9orique","ror":"https://ror.org/02bsd9p69","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142476485","https://openalex.org/I4210098836","https://openalex.org/I4210111960","https://openalex.org/I4210145102"]}],"countries":["DE","FR","PL"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["authors were at Lucent Bell Laboratories, 600-700 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","& Theoretical Computer Science, 2003"],"affiliations":[{"raw_affiliation_string":"authors were at Lucent Bell Laboratories, 600-700 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","institution_ids":["https://openalex.org/I1322087612"]},{"raw_affiliation_string":"& Theoretical Computer Science, 2003","institution_ids":["https://openalex.org/I4210111960","https://openalex.org/I3019243323"]}]},{"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/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]},{"id":"https://openalex.org/I3019243323","display_name":"Center for Theoretical Physics","ror":"https://ror.org/04kfyt897","country_code":"PL","type":"facility","lineage":["https://openalex.org/I3019243323","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4210111960","display_name":"Centre de Physique Th\u00e9orique","ror":"https://ror.org/02bsd9p69","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142476485","https://openalex.org/I4210098836","https://openalex.org/I4210111960","https://openalex.org/I4210145102"]}],"countries":["DE","FR","PL"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["authors were at Lucent Bell Laboratories, 600-700 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","& Theoretical Computer Science, 2003"],"affiliations":[{"raw_affiliation_string":"authors were at Lucent Bell Laboratories, 600-700 Mountain Avenue, Murray Hill, NJ 07974-0636, USA","institution_ids":["https://openalex.org/I1322087612"]},{"raw_affiliation_string":"& Theoretical Computer Science, 2003","institution_ids":["https://openalex.org/I4210111960","https://openalex.org/I3019243323"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":["https://openalex.org/I1322087612","https://openalex.org/I3019243323","https://openalex.org/I4210111960"],"apc_list":null,"apc_paid":null,"fwci":1.3481,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.82233031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"2","issue":"1","first_page":"53","last_page":"64"},"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.9990000128746033,"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.9990000128746033,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9975000023841858,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9370246529579163},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7831345200538635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6896877884864807},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.5347864627838135},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4899515211582184},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4696929454803467},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4643002152442932},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4342586398124695},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.43325892090797424},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4315034747123718},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4274277687072754},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.41283366084098816},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37346315383911133},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.28321847319602966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19909793138504028}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9370246529579163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7831345200538635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6896877884864807},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5347864627838135},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4899515211582184},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4696929454803467},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4643002152442932},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4342586398124695},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.43325892090797424},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4315034747123718},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4274277687072754},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.41283366084098816},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37346315383911133},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28321847319602966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19909793138504028},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2006.v002a003","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a003","pdf_url":"https://theoryofcomputing.org/articles/v002a003/v002a003.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2006.v002a003","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2006.v002a003","pdf_url":"https://theoryofcomputing.org/articles/v002a003/v002a003.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3827657932","display_name":"Probabilistic Approaches in Combinatorial Optimization","funder_award_id":"0208005","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4702511812","display_name":"CAREER:    Algorithmic Theory and Applications of Metric Emeddings","funder_award_id":"0448095","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G776067557","display_name":"ITR - (ASE+NHS) - (DMC+INT+SOC):    Resilient Storage and Querying in Decentralized Networks","funder_award_id":"0426683","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2170170950.pdf","grobid_xml":"https://content.openalex.org/works/W2170170950.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1566939909","https://openalex.org/W1952648253","https://openalex.org/W1970076003","https://openalex.org/W2016332468","https://openalex.org/W2018511415","https://openalex.org/W2025050335","https://openalex.org/W2038190710","https://openalex.org/W2061945091","https://openalex.org/W2084415648","https://openalex.org/W2114493937","https://openalex.org/W2166965860","https://openalex.org/W2295961103","https://openalex.org/W2610052675","https://openalex.org/W3030774092"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W2044818254","https://openalex.org/W2075346653","https://openalex.org/W4247100793","https://openalex.org/W1678097331","https://openalex.org/W2077783414","https://openalex.org/W1966805076","https://openalex.org/W1498886170","https://openalex.org/W2088188524"],"abstract_inverted_index":{"In":[0],"the":[1,33,45,62,65,72,75,88,102],"Covering":[2,54],"Steiner":[3,55,67,104],"problem,":[4,90],"we":[5,86,100],"are":[6,94],"given":[7],"an":[8],"undirected":[9],"graph":[10,76],"with":[11,20,25,81,97],"edgecosts,":[12],"and":[13,64,91],"some":[14],"subsets":[15],"of":[16,48,61,74,84],"vertices":[17,49,73],"called":[18],"groups,":[19],"each":[21],"group":[22,80],"being":[23],"equipped":[24],"a":[26,38,58,82],"non-negative":[27],"integer":[28],"value":[29],"(called":[30],"its":[31],"requirement);":[32],"problem":[34,56],"is":[35,57],"to":[36],"find":[37],"minimum-cost":[39],"tree":[40],"which":[41],"spans":[42],"at":[43],"least":[44],"required":[46],"number":[47],"from":[50],"every":[51],"group.":[52],"The":[53],"common":[59],"generalization":[60],"k-MST":[63,89],"Group":[66,103],"problems;":[68],"indeed,":[69],"when":[70,92],"all":[71],"lie":[77],"in":[78],"one":[79],"requirement":[83],"k,":[85],"get":[87],"there":[93],"multiple":[95],"groups":[96],"unit":[98],"requirements,":[99],"obtain":[101],"problem.":[105]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}