{"id":"https://openalex.org/W2127814549","doi":"https://doi.org/10.1007/3-540-45535-3_5","title":"Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation","display_name":"Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2127814549","doi":"https://doi.org/10.1007/3-540-45535-3_5","mag":"2127814549"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45535-3_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45535-3_5","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/A5110284741","display_name":"Fabi\u00e1n A. Chudak","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142238","display_name":"Tellabs (United States)","ror":"https://ror.org/03pbzwf28","country_code":"US","type":"company","lineage":["https://openalex.org/I4210142238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fabi\u00e1n A. Chudak","raw_affiliation_strings":["Tellabs Research Center, 1 Kendall Square, Building 100, Suite 202, Cambridge, MA, 02139, USA","Tellabs Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tellabs Research Center, 1 Kendall Square, Building 100, Suite 202, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I4210142238"]},{"raw_affiliation_string":"Tellabs Research Center","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022886322","display_name":"Tim Roughgarden","orcid":"https://orcid.org/0000-0002-7163-8306"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tim Roughgarden","raw_affiliation_strings":["Department of Computer Science, Cornell University, Upson Hall, Ithaca, NY, 14853, USA","Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Upson Hall, Ithaca, NY, 14853, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667154","display_name":"David P. Williamson","orcid":"https://orcid.org/0000-0002-2884-0058"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Williamson","raw_affiliation_strings":["IBM Almaden Research Center, 650 Harry Rd. K53/B1, San Jose, CA, 95120, USA","IBM Almaden Research Center,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, 650 Harry Rd. K53/B1, San Jose, CA, 95120, USA","institution_ids":["https://openalex.org/I4210085935"]},{"raw_affiliation_string":"IBM Almaden Research Center,#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"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":null,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"60","last_page":"70"},"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.9991999864578247,"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.9991999864578247,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9883999824523926,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9128916263580322},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6916490793228149},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6175229549407959},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5363705158233643},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5252741575241089},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.517716646194458},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5168735980987549},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4690675437450409},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.45572108030319214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43366289138793945},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4227219820022583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41853445768356323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33689773082733154},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.289470911026001},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.19622337818145752},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18299588561058044},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13867884874343872},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.1091550886631012}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9128916263580322},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6916490793228149},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6175229549407959},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5363705158233643},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5252741575241089},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.517716646194458},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5168735980987549},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4690675437450409},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.45572108030319214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43366289138793945},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4227219820022583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41853445768356323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33689773082733154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.289470911026001},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.19622337818145752},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18299588561058044},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13867884874343872},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.1091550886631012},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/3-540-45535-3_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45535-3_5","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.135.4070","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.4070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://legacy.orie.cornell.edu/~dpw/kmst.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.5972","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.5972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/timr/papers/kmst.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.1172","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/timr/papers/kmst_full.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.2964","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2964","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/timr/papers/kmst_full.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.5699","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~tim/papers/kmst.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":17,"referenced_works":["https://openalex.org/W94285304","https://openalex.org/W1544515183","https://openalex.org/W1575625195","https://openalex.org/W1854155592","https://openalex.org/W1891203375","https://openalex.org/W1966793805","https://openalex.org/W1976222519","https://openalex.org/W1998678640","https://openalex.org/W2001139415","https://openalex.org/W2011595401","https://openalex.org/W2013576079","https://openalex.org/W2044718761","https://openalex.org/W2070664846","https://openalex.org/W2093376706","https://openalex.org/W2112638680","https://openalex.org/W2147258429","https://openalex.org/W4206734951"],"related_works":["https://openalex.org/W2518240130","https://openalex.org/W3016811403","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2130375301","https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2400989246","https://openalex.org/W4308416203","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}