{"id":"https://openalex.org/W1998678640","doi":"https://doi.org/10.1137/s009753979528826x","title":"New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen","display_name":"New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1998678640","doi":"https://doi.org/10.1137/s009753979528826x","mag":"1998678640"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979528826x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979528826x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5110260801","display_name":"Baruch Awerbuch","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avrim Blum","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101983359","display_name":"Santosh Vempala","orcid":"https://orcid.org/0000-0002-3779-433X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Santosh Vempala","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110260801"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5598,"has_fulltext":false,"cited_by_count":149,"citation_normalized_percentile":{"value":0.92570683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"28","issue":"1","first_page":"254","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9937000274658203,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9937000274658203,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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.9850999712944031,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8232300281524658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7031933069229126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5630089044570923},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5575670003890991},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5104407668113708},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4745948016643524},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4681572914123535},{"id":"https://openalex.org/keywords/notice","display_name":"Notice","score":0.46432632207870483},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4450727701187134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4361611604690552},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4171138107776642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3715445101261139},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31448501348495483},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.08780452609062195}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8232300281524658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7031933069229126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5630089044570923},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5575670003890991},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5104407668113708},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4745948016643524},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4681572914123535},{"id":"https://openalex.org/C2779913896","wikidata":"https://www.wikidata.org/wiki/Q7063001","display_name":"Notice","level":2,"score":0.46432632207870483},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4450727701187134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4361611604690552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4171138107776642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3715445101261139},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31448501348495483},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.08780452609062195},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s009753979528826x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979528826x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.4687","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/afs/cs/Web/People/avrim/Papers/./prizetsp.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1986056047","https://openalex.org/W2003281104"],"related_works":["https://openalex.org/W1584380088","https://openalex.org/W2051378252","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114"],"abstract_inverted_index":{"We":[0,159],"consider":[1],"a":[2,20,27,118,141,213],"formalization":[3],"of":[4,14,43,138,198,232,234],"the":[5,41,54,61,65,72,85,91,97,113,129,145,151,168,196,211,220,228],"following":[6],"problem.":[7],"A":[8],"salesperson":[9,25],"must":[10,95,217],"sell":[11,60],"some":[12],"quota":[13,62],"brushes":[15,44],"in":[16,32,49,87,210,219],"order":[17,86],"to":[18,22,57,59,82,89,106,167],"win":[19],"trip":[21],"Hawaii.":[23],"This":[24],"has":[26,36],"map":[28],"(a":[29],"weighted":[30],"graph)":[31],"which":[33,88,101,173],"each":[34],"city":[35],"an":[37,164,179,190],"attached":[38],"demand":[39],"specifying":[40],"number":[42],"that":[45,50,70,201,216],"can":[46],"be":[47,218],"sold":[48],"city.":[51],"What":[52],"is":[53,174],"best":[55,230],"route":[56],"take":[58],"while":[63],"traveling":[64,74,134],"least":[66,199],"distance":[67],"possible?":[68],"Notice":[69],"unlike":[71],"standard":[73],"salesman":[75,135],"problem,":[76,124],"not":[77],"only":[78],"do":[79,103,160],"we":[80,94,104,111,143],"need":[81],"figure":[83],"out":[84],"visit":[90],"cities,":[92],"but":[93],"decide":[96],"more":[98,131],"fundamental":[99],"question:":[100],"cities":[102],"want":[105],"visit?":[107],"In":[108],"this":[109,123,161],"paper":[110],"give":[112],"first":[114],"approximation":[115,166],"algorithm":[116],"having":[117],"polylogarithmic":[119],"performance":[120],"guarantee":[121],"for":[122,128],"as":[125,127,176,222],"well":[126],"slightly":[130],"general":[132],"\"prize-collecting":[133],"problem\"":[136,148,153],"(PCTSP)":[137],"Balas,":[139],"and":[140,157,189],"variation":[142],"call":[144],"\"bank":[146],"robber":[147],"(also":[149],"called":[150],"\"orienteering":[152],"by":[154,162],"Golden,":[155],"Levi,":[156],"Vohra).":[158],"providing":[163],"O(log2k)":[165],"somewhat":[169],"cleaner":[170],"k-MST":[171],"problem":[172,212],"defined":[175],"follows.":[177],"Given":[178],"undirected":[180],"graph":[181],"on":[182,227],"n":[183],"nodes":[184],"with":[185],"nonnegative":[186],"edge":[187],"weights":[188],"integer":[191],"$k":[192],"\\leq":[193],"n$,":[194],"find":[195],"tree":[197,221],"weight":[200],"spans":[202],"k":[203],"vertices.":[204],"(If":[205],"desired,":[206],"one":[207],"may":[208],"specify":[209],"\"root":[214],"vertex\"":[215],"well.)":[223],"Our":[224],"result":[225],"improves":[226],"previous":[229],"bound":[231],"$O(\\sqrt{k})$":[233],"Ravi":[235],"et":[236],"al.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}