乐胖代购免代理版

{"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":{"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_indexed_in_scopus":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3570957","any_repository_has_fulltext":true},"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":"funder","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arun Ganesh","raw_affiliation_strings":["UC Berkeley, Berkeley, California, USA"],"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":"funder","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"],"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":"funder","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, Durham, North Carolina, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, North Carolina, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":59},"biblio":{"volume":"19","issue":"2","first_page":"1","last_page":"37"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998,"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.9998,"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.9983,"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.9967,"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.81222063},{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.593231},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4744419}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.81222063},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8044346},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.75751436},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6646882},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.593231},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5443711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5380731},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.50727004},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.47800365},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4744419},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.47269228},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44728205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42952192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3796169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3716387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23255926},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","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}],"mesh":[],"locations_count":3,"locations":[{"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_indexed_in_scopus":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.54","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol168-icalp2020/LIPIcs.ICALP.2020.54/LIPIcs.ICALP.2020.54.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":["Schloss Dagstuhl \u2013 Leibniz Center for Informatics"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.08137","pdf_url":"http://arxiv.org/pdf/2005.08137","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"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_indexed_in_scopus":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"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/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W3101281637","https://openalex.org/W2503538928","https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W2051378252","https://openalex.org/W2044443696","https://openalex.org/W1703428550","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]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3024720357","counts_by_year":[],"updated_date":"2025-03-01T20:52:37.031104","created_date":"2020-05-21"}