{"id":"https://openalex.org/W3024720357","doi":"https://doi.org/10.1145/3570957","title":"Robust Algorithms for TSP and Steiner Tree","display_name":"Robust Algorithms for TSP and Steiner Tree","publication_year":2022,"publication_date":"2022-12-14","ids":{"openalex":"https://openalex.org/W3024720357","doi":"https://doi.org/10.1145/3570957","mag":"3024720357"},"language":"en","primary_location":{"id":"doi:10.1145/3570957","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3570957","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3570957","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3570957","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089993465","display_name":"Arun Ganesh","orcid":"https://orcid.org/0000-0001-6057-7619"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arun Ganesh","raw_affiliation_strings":["UC Berkeley, Berkeley, California, USA"],"raw_orcid":"https://orcid.org/0000-0001-6057-7619","affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, California, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046808993","display_name":"Bruce M. Maggs","orcid":"https://orcid.org/0000-0002-5692-7062"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce M. Maggs","raw_affiliation_strings":["Duke University and Emerald Innovations, Durham, North Carolina, USA"],"raw_orcid":"https://orcid.org/0000-0002-5692-7062","affiliations":[{"raw_affiliation_string":"Duke University and Emerald Innovations, Durham, North Carolina, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, Durham, North Carolina, USA"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University, Durham, North Carolina, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089993465"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.339,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59497009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"19","issue":"2","first_page":"1","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8122206330299377},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.804434597492218},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7575143575668335},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.664688229560852},{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.5932310223579407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5443711280822754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5380731225013733},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5072700381278992},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4780036509037018},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47444188594818115},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4726922810077667},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4472820460796356},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42952191829681396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3796168863773346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.371638685464859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23255926370620728}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8122206330299377},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.804434597492218},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7575143575668335},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.664688229560852},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.5932310223579407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5443711280822754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5380731225013733},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5072700381278992},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4780036509037018},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47444188594818115},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4726922810077667},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4472820460796356},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42952191829681396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3796168863773346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.371638685464859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23255926370620728},{"id":"https://openalex.org/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3570957","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3570957","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3570957","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3570957","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3570957","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3570957","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1082722339","display_name":null,"funder_award_id":"CCF-1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2954400926","display_name":null,"funder_award_id":"CCF-1535989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3975607665","display_name":"Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization","funder_award_id":"1955703","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226018963","display_name":"CAREER: New Directions in Graph Algorithms","funder_award_id":"1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5857933033","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535972","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/G7019761770","display_name":null,"funder_award_id":"1535989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7291707221","display_name":null,"funder_award_id":"CCF-1535972","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/W3024720357.pdf","grobid_xml":"https://content.openalex.org/works/W3024720357.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W128170130","https://openalex.org/W1484951415","https://openalex.org/W1496498429","https://openalex.org/W1519520700","https://openalex.org/W1526404960","https://openalex.org/W1604332079","https://openalex.org/W1714357736","https://openalex.org/W1727529013","https://openalex.org/W1963888335","https://openalex.org/W1966028860","https://openalex.org/W1966509452","https://openalex.org/W1975162826","https://openalex.org/W1977543916","https://openalex.org/W1981673685","https://openalex.org/W1982280823","https://openalex.org/W1987039917","https://openalex.org/W1988146710","https://openalex.org/W1989485302","https://openalex.org/W1991055327","https://openalex.org/W2008959214","https://openalex.org/W2018274124","https://openalex.org/W2028589351","https://openalex.org/W2043459466","https://openalex.org/W2043644965","https://openalex.org/W2051407192","https://openalex.org/W2057974767","https://openalex.org/W2068827145","https://openalex.org/W2076901012","https://openalex.org/W2080208950","https://openalex.org/W2094410510","https://openalex.org/W2134396776","https://openalex.org/W2142818506","https://openalex.org/W2160575059","https://openalex.org/W2165775468","https://openalex.org/W2569455461","https://openalex.org/W2611804663","https://openalex.org/W2963996640","https://openalex.org/W4229862683","https://openalex.org/W4253347690"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2051378252","https://openalex.org/W1584380088"],"abstract_inverted_index":{"Robust":[0],"optimization":[1,104],"is":[2],"a":[3,16,22,33,83],"widely":[4],"studied":[5],"area":[6],"in":[7,56,67,100],"operations":[8],"research,":[9],"where":[10],"the":[11,29,43,47,59,113],"algorithm":[12,35],"takes":[13],"as":[14,42,71],"input":[15,60],"range":[17],"of":[18,52],"values":[19],"and":[20,50,74,106,117],"outputs":[21],"single":[23],"solution":[24,55],"that":[25,51,81],"performs":[26],"well":[27],"for":[28,97,112],"entire":[30],"range.":[31],"Specifically,":[32],"robust":[34,78,95],"aims":[36],"to":[37],"minimize":[38],"regret":[39,87,99,111],",":[40,69],"defined":[41],"maximum":[44],"difference":[45],"between":[46],"solution\u2019s":[48],"cost":[49],"an":[53],"optimal":[54],"hindsight":[57],"once":[58],"has":[61],"been":[62],"realized.":[63],"For":[64],"graph":[65,103],"problems":[66],"P":[68],"such":[70],"shortest":[72],"path":[73],"minimum":[75],"spanning":[76],"tree,":[77],"polynomial-time":[79],"algorithms":[80,96],"obtain":[82],"constant":[84,108],"approximation":[85],"on":[86,110],"are":[88],"known.":[89],"In":[90],"this":[91],"paper,":[92],"we":[93],"study":[94],"minimizing":[98],"NP":[101],"-hard":[102],"problems,":[105],"give":[107],"approximations":[109],"classical":[114],"traveling":[115],"salesman":[116],"Steiner":[118],"tree":[119],"problems.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}