{"id":"https://openalex.org/W2123087902","doi":"https://doi.org/10.1137/090771429","title":"Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP","display_name":"Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2123087902","doi":"https://doi.org/10.1137/090771429","mag":"2123087902"},"language":"en","primary_location":{"id":"doi:10.1137/090771429","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090771429","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/A5088773959","display_name":"Aaron Archer","orcid":"https://orcid.org/0000-0002-7761-2000"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aaron Archer","raw_affiliation_strings":["aarcher@research.att.com and hajiagha@research.att.com and howard@research.att.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"aarcher@research.att.com and hajiagha@research.att.com and howard@research.att.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113873446","display_name":"MohammadHossein Bateni","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MohammadHossein Bateni","raw_affiliation_strings":["mbateni@cs.princeton.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"mbateni@cs.princeton.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087578885","display_name":"Howard Karloff","orcid":"https://orcid.org/0000-0003-4490-2324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Howard Karloff","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.2778,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.97944779,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"40","issue":"2","first_page":"309","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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.9980000257492065,"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.9304073452949524},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7343279719352722},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7001134753227234},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6845420598983765},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6158405542373657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5584692358970642},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.520804762840271},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4349140524864197},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43286484479904175},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43137669563293457},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4243055284023285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4027373194694519},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3902600407600403},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37791725993156433},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32784125208854675},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3227440118789673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19726860523223877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15278977155685425}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9304073452949524},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7343279719352722},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7001134753227234},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6845420598983765},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6158405542373657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5584692358970642},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.520804762840271},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4349140524864197},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43286484479904175},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43137669563293457},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4243055284023285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4027373194694519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3902600407600403},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37791725993156433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32784125208854675},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3227440118789673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19726860523223877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15278977155685425},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090771429","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090771429","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"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":15,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W1986056047","https://openalex.org/W2001139415","https://openalex.org/W2009279347","https://openalex.org/W2011823863","https://openalex.org/W2012130001","https://openalex.org/W2012511041","https://openalex.org/W2013576079","https://openalex.org/W2033647570","https://openalex.org/W2039298646","https://openalex.org/W2044119054","https://openalex.org/W2077074857","https://openalex.org/W2139841919","https://openalex.org/W2162750432","https://openalex.org/W2767048380"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W132011890","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2114997377"],"abstract_inverted_index":{"We":[0,149],"study":[1],"the":[2,34,52,55,59,62,65,94,105,171],"prize-collecting":[3,7,12,164,180],"Steiner":[4,181],"tree":[5,40,182],"(PCST),":[6],"traveling":[8],"salesman":[9],"(PCTSP),":[10],"and":[11,26,61],"path":[13,47],"(PC-Path)":[14],"problems.":[15],"Given":[16],"a":[17,21,27,39,75,109,118,141,159],"graph":[18],"$(V,E)$":[19],"with":[20],"cost":[22],"on":[23,31],"each":[24,32],"edge":[25,56],"penalty":[28],"(a.k.a.":[29],"prize)":[30],"node,":[33],"goal":[35],"is":[36,183],"to":[37,73,81,93,143,169],"find":[38],"(for":[41,44,48],"PCST),":[42],"cycle":[43],"PCTSP),":[45],"or":[46],"PC-Path)":[49],"that":[50,166],"minimizes":[51],"sum":[53],"of":[54,64,96,130,136],"costs":[57],"in":[58,116,123],"tree/cycle/path":[60],"penalties":[63],"nodes":[66],"not":[67],"spanned":[68],"by":[69,91,158],"it.":[70],"In":[71],"addition":[72],"being":[74],"useful":[76],"theoretical":[77],"tool":[78],"for":[79,104,112,120,146,153,162,179],"helping":[80],"solve":[82],"other":[83],"optimization":[84,95],"problems,":[85,108,156],"PCST":[86,131],"has":[87,132,139],"been":[88,140],"applied":[89],"fruitfully":[90],"AT&T":[92],"real-world":[97],"telecommunications":[98],"networks.":[99],"The":[100,125],"most":[101],"recent":[102],"improvements":[103,145],"first":[106,115],"two":[107],"2-approximation":[110,119],"algorithm":[111],"each,":[113],"appeared":[114,122],"1992;":[117],"PC-Path":[121],"2003.":[124],"natural":[126],"linear":[127],"programming":[128],"relaxation":[129],"an":[133],"integrality":[134,172],"gap":[135,173],"2,":[137],"which":[138],"barrier":[142],"further":[144],"this":[147],"problem.":[148],"present":[150],"$(2-\\epsilon)$-approximation":[151],"algorithms":[152,165],"all":[154],"three":[155],"connected":[157],"unified":[160],"technique":[161],"improving":[163],"allows":[167],"us":[168],"circumvent":[170],"barrier.":[174],"Specifically,":[175],"our":[176],"approximation":[177],"ratio":[178],"below":[184],"1.9672.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}