{"id":"https://openalex.org/W2009279347","doi":"https://doi.org/10.1137/07068151x","title":"A Faster, Better Approximation Algorithm for the Minimum Latency Problem","display_name":"A Faster, Better Approximation Algorithm for the Minimum Latency Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2009279347","doi":"https://doi.org/10.1137/07068151x","mag":"2009279347"},"language":"en","primary_location":{"id":"doi:10.1137/07068151x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07068151x","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":[{"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":"Aaron Archer","raw_affiliation_strings":["Operations Research Department, Cornell University, Ithaca, NY 14853"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Department, Cornell University, Ithaca, NY 14853","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064961974","display_name":"Asaf Levin","orcid":"https://orcid.org/0000-0001-7935-6218"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Asaf Levin","raw_affiliation_strings":["Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"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/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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, 650 Harry Rd. K53/B1, San Jose, CA 95120","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.1072,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.98072387,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"37","issue":"5","first_page":"1472","last_page":"1498"},"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.9972000122070312,"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.9972000122070312,"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.9947999715805054,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9726999998092651,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7683386206626892},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7040524482727051},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6934824585914612},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6305007338523865},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5840197801589966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5730648636817932},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5314589738845825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48891130089759827},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4699297845363617},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4268730580806732},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3742614686489105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32131004333496094}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7683386206626892},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7040524482727051},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6934824585914612},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6305007338523865},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5840197801589966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5730648636817932},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5314589738845825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48891130089759827},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4699297845363617},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4268730580806732},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3742614686489105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32131004333496094},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/07068151x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07068151x","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.113.8225","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.8225","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/minlat.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.211","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.211","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.almaden.ibm.com/cs/people/dpw/Recent/minlat.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.835.9428","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.835.9428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://ecommons.cornell.edu/bitstream/handle/1813/9239/TR001362.pdf%3Bjsessionid%3D4D4327C894E680816ECAAE4A3A2D5A4F?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:ecommons.cornell.edu:1813/9239","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/9239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W80909727","https://openalex.org/W94285304","https://openalex.org/W1531274257","https://openalex.org/W1558378280","https://openalex.org/W1576536481","https://openalex.org/W1760833224","https://openalex.org/W1966793805","https://openalex.org/W1969925267","https://openalex.org/W1982148583","https://openalex.org/W1991678853","https://openalex.org/W1995284651","https://openalex.org/W2001139415","https://openalex.org/W2012511041","https://openalex.org/W2013576079","https://openalex.org/W2014696791","https://openalex.org/W2020931444","https://openalex.org/W2022183635","https://openalex.org/W2027029507","https://openalex.org/W2034372438","https://openalex.org/W2038190710","https://openalex.org/W2039097929","https://openalex.org/W2056425817","https://openalex.org/W2059305197","https://openalex.org/W2066528983","https://openalex.org/W2072136110","https://openalex.org/W2078610911","https://openalex.org/W2086917808","https://openalex.org/W2093376706","https://openalex.org/W2095776854","https://openalex.org/W2098465634","https://openalex.org/W2098717403","https://openalex.org/W2111697972","https://openalex.org/W2112638680","https://openalex.org/W2115556222","https://openalex.org/W2116018028","https://openalex.org/W2139841919","https://openalex.org/W2141355868","https://openalex.org/W2148742122","https://openalex.org/W2168881041","https://openalex.org/W2767048380","https://openalex.org/W2808555656","https://openalex.org/W4255108251"],"related_works":["https://openalex.org/W2090953203","https://openalex.org/W2070751425","https://openalex.org/W1992520347","https://openalex.org/W1983097829","https://openalex.org/W3188033804","https://openalex.org/W2116018028","https://openalex.org/W2009279347","https://openalex.org/W2969769386","https://openalex.org/W2126169066","https://openalex.org/W1992702935"],"abstract_inverted_index":{"We":[0,184,264,313],"give":[1,186],"a":[2,68,94,106,187,214,242,261,319],"7.18-approximation":[3],"algorithm":[4,43,56,77,179,193,216,240,317],"for":[5,48,57,71,229,288,299],"the":[6,18,30,49,58,116,132,137,142,147,152,158,162,173,196,238,257,269,323],"minimum":[7,50,324],"latency":[8,51,325],"problem":[9,52,63],"that":[10,194,233,273,304],"uses":[11,203],"only":[12,204,298],"$O(n":[13,87],"\\log":[14,90,101,182],"n)$":[15,91,102,206,223],"calls":[16],"to":[17,168,212,248,267,285,309,318],"prize-collecting":[19],"Steiner":[20],"tree":[21,61],"(PCST)":[22],"subroutine":[23,164,259],"of":[24,44,74,83,96,108,119,134,177,191,251,291,302,322],"Goemans":[25,45,278],"and":[26,38,46,122,124,126,139,209,279],"Williamson.":[27],"This":[28,245],"improves":[29],"previous":[31,42],"best":[32],"algorithms":[33,118],"in":[34,136,146,170,200,255,311],"both":[35],"performance":[36],"guarantee":[37,199],"running":[39,153,175],"time.":[40],"A":[41],"Kleinberg":[47,280],"requires":[53],"an":[54,80],"approximation":[55,81,198,271],"k-minimum":[59],"spanning":[60],"(k-MST)":[62],"which":[64,256],"is":[65,141,155,180,232],"called":[66],"as":[67,241],"black":[69,243],"box":[70],"each":[72],"value":[73],"k.":[75],"Their":[76],"can":[78,165],"achieve":[79],"factor":[82,95,107,218],"10.77":[84],"while":[85],"making":[86],"(n+\\log":[88],"C)":[89,100],"PCST":[92,103,113,159,163,207,224,258],"calls,":[93,104,114,208],"8.98":[97],"using":[98,110,220],"$O(n^3(n+\\log":[99],"or":[105],"$7.18+\\epsilon$":[109],"$n^{O(1/\\epsilon)}\\log":[111],"C$":[112],"via":[115],"k-MST":[117,239],"Garg,":[120],"Arya":[121],"Ramesh,":[123],"Arora":[125],"Karakostas,":[127],"respectively.":[128],"Here":[129],"n":[130],"denotes":[131],"number":[133],"nodes":[135],"instance,":[138],"C":[140],"largest":[143],"edge":[144],"cost":[145],"input.":[148],"In":[149],"all":[150,289],"cases,":[151],"time":[154,176],"dominated":[156],"by":[157,277],"calls.":[160,225],"Since":[161],"be":[166,275],"implemented":[167],"run":[169],"$O(n^2)$":[171],"time,":[172],"overall":[174],"our":[178,192,230,316],"$O(n^3":[181],"n)$.":[183],"also":[185,314],"faster":[188],"randomized":[189],"version":[190,321],"achieves":[195],"same":[197,270],"expectation,":[201],"but":[202],"$O(\\log^2":[205],"derandomize":[210],"it":[211],"obtain":[213,268],"deterministic":[215],"with":[217],"$7.18+\\epsilon$,":[219],"$O(\\frac{1}{\\epsilon}":[221],"\\log^2":[222],"The":[226],"basic":[227],"idea":[228],"improvement":[231],"we":[234,282,295,305],"do":[235],"not":[236,307],"treat":[237],"box.":[244],"allows":[246],"us":[247],"take":[249],"advantage":[250],"some":[252,300],"special":[253],"situations":[254],"delivers":[260],"2-approximate":[262,286],"k-MST.":[263],"are":[265,306],"able":[266,308],"ratio":[272],"would":[274],"given":[276],"if":[281],"had":[283],"access":[284],"k-MSTs":[287],"values":[290,301],"k,":[292],"even":[293],"though":[294],"have":[296],"them":[297],"k":[303],"specify":[310],"advance.":[312],"extend":[315],"weighted":[320],"problem.":[326]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}