{"id":"https://openalex.org/W4411319844","doi":"https://doi.org/10.1145/3717823.3718299","title":"A (2+\u03b5)-Approximation Algorithm for Metric \ud835\udc58-Median","display_name":"A (2+\u03b5)-Approximation Algorithm for Metric \ud835\udc58-Median","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319844","doi":"https://doi.org/10.1145/3717823.3718299"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718299","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/en/publications/a79fcd15-b995-4c7c-8163-8fbce7427e7c","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, Grenoble, France"],"raw_orcid":"https://orcid.org/0000-0002-0779-8962","affiliations":[{"raw_affiliation_string":"Google Research, Grenoble, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]},{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["IDSIA at USI-SUPSI, Lugano, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-9676-4931","affiliations":[{"raw_affiliation_string":"IDSIA at USI-SUPSI, Lugano, Switzerland","institution_ids":["https://openalex.org/I2614128279","https://openalex.org/I15196421"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, Ann Arbor, USA"],"raw_orcid":"https://orcid.org/0000-0003-1454-7587","affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098622084","display_name":"Chris Schwiegelshohn","orcid":"https://orcid.org/0009-0008-9114-0661"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Chris Schwiegelshohn","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0009-0008-9114-0661","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-2997-1372","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.517,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.92083048,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"615","last_page":"624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9927999973297119,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.584204912185669},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5759257674217224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5435490608215332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4642878770828247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3431990146636963},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06363415718078613}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.584204912185669},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5759257674217224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5435490608215332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4642878770828247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3431990146636963},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06363415718078613},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3717823.3718299","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/a79fcd15-b995-4c7c-8163-8fbce7427e7c","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/a79fcd15-b995-4c7c-8163-8fbce7427e7c","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cohen-Addad, V, Grandoni, F, Lee, E, Schwiegelshohn, C & Svensson, O 2025, A (2+\u03f5)-Approximation Algorithm for Metric \u03ba-Median. in M Kouck\u00fd & N Bansal (eds), STOC '25 : Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, NY, Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 615-624, 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czech Republic, 23/06/2025. https://doi.org/10.1145/3717823.3718299","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/a79fcd15-b995-4c7c-8163-8fbce7427e7c","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/a79fcd15-b995-4c7c-8163-8fbce7427e7c","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cohen-Addad, V, Grandoni, F, Lee, E, Schwiegelshohn, C & Svensson, O 2025, A (2+\u03f5)-Approximation Algorithm for Metric \u03ba-Median. in M Kouck\u00fd & N Bansal (eds), STOC '25 : Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, NY, Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 615-624, 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czech Republic, 23/06/2025. https://doi.org/10.1145/3717823.3718299","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W169553655","https://openalex.org/W1516429886","https://openalex.org/W1973264045","https://openalex.org/W1973529814","https://openalex.org/W1977541023","https://openalex.org/W1978117135","https://openalex.org/W2003207175","https://openalex.org/W2006514056","https://openalex.org/W2010480966","https://openalex.org/W2016332468","https://openalex.org/W2018165630","https://openalex.org/W2023770210","https://openalex.org/W2029698681","https://openalex.org/W2033647570","https://openalex.org/W2041571997","https://openalex.org/W2044028871","https://openalex.org/W2052494364","https://openalex.org/W2076746184","https://openalex.org/W2085751730","https://openalex.org/W2114493937","https://openalex.org/W2136442119","https://openalex.org/W2139841919","https://openalex.org/W2155429109","https://openalex.org/W2165420145","https://openalex.org/W2177090493","https://openalex.org/W2343942810","https://openalex.org/W2608158342","https://openalex.org/W2739434859","https://openalex.org/W2769481137","https://openalex.org/W2942858066","https://openalex.org/W2963411648","https://openalex.org/W2964283450","https://openalex.org/W2966797629","https://openalex.org/W2971624618","https://openalex.org/W2971668650","https://openalex.org/W2981838741","https://openalex.org/W3114244520","https://openalex.org/W3162678658","https://openalex.org/W4206704767","https://openalex.org/W4210590882","https://openalex.org/W4236385439","https://openalex.org/W4243637616","https://openalex.org/W4281762941","https://openalex.org/W4316652377","https://openalex.org/W4316652396","https://openalex.org/W4411319844","https://openalex.org/W6668990524"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596"],"abstract_inverted_index":{"In":[0,54],"the":[1,43,65,92,98,114,118,150,169,173,197,265,284,303,318],"classical":[2],"NP-hard":[3],"(metric)":[4],"k-median":[5,77,115,170,221],"problem,":[6,171],"we":[7,163,191,246],"are":[8],"given":[9],"a":[10,35,73,131,137,165,184,193,208,217,237,248,279,288,295,307],"set":[11],"of":[12,37,178,186,196],"n":[13],"clients":[14],"and":[15,62,97,287],"centers":[16,40,81,315],"with":[17,23,202],"metric":[18],"distances":[19],"between":[20,94],"them,":[21],"along":[22],"an":[24,103,146,261,270],"integer":[25],"parameter":[26],"k":[27,38,80,109,227,314],"\u2265":[28],"1.":[29],"The":[30],"objective":[31],"is":[32],"to":[33,49,106,149,215,290,294,301],"select":[34],"subset":[36],"open":[39,52,107],"that":[41,78,200,222,240,311],"minimizes":[42],"total":[44],"distance":[45],"from":[46,260],"each":[47],"client":[48],"its":[50],"closest":[51],"center.":[53],"their":[55,95,128],"seminal":[56],"work,":[57],"Jain,":[58],"Mahdian,":[59],"Markakis,":[60],"Saberi,":[61],"Vazirani":[63],"presented":[64],"Greedy":[66,198],"algorithm":[67,75,96,104,129,167,199,219,239,251,286,310],"for":[68,76,159,168,220,253],"facility":[69],"location,":[70],"which":[71,143],"implies":[72,236],"2-approximation":[74],"opens":[79,224,312],"in":[82,113,242],"expectation.":[83],"Since":[84],"then,":[85],"substantial":[86],"research":[87],"has":[88],"aimed":[89],"at":[90,225,268],"narrowing":[91],"gap":[93],"best":[99],"achievable":[100],"approximation":[101,151,176],"by":[102,126,136,267,283],"guaranteed":[105],"exactly":[108,313],"centers,":[110],"as":[111],"required":[112],"problem.":[116],"During":[117],"last":[119],"decade,":[120],"all":[121],"improvements":[122],"have":[123],"been":[124],"achieved":[125],"leveraging":[127],"(or":[130],"small":[132],"improvement":[133],"thereof),":[134],"followed":[135],"second":[138],"step":[139],"called":[140],"bi-point":[141],"rounding,":[142],"inherently":[144],"adds":[145],"additional":[147],"factor":[148,177],"guarantee.":[152,320],"Our":[153,180],"main":[154],"result":[155,305],"closes":[156],"this":[157,212,234,274],"gap:":[158],"any":[160,258],"&gt;":[161],"0,":[162],"present":[164,192],"(2+)-approximation":[166,218,238,250,319],"improving":[172],"previous":[174,304],"best-known":[175],"2.613.":[179],"approach":[181,281],"builds":[182],"on":[183],"combination":[185],"two":[187],"key":[188],"algorithms.":[189],"First,":[190],"non-trivial":[194],"modification":[195],"operates":[201],"only":[203],"O(logn/<sup>2</sup>)":[204,229],"adaptive":[205],"phases.":[206],"Through":[207],"novel":[209,249],"walk-between-solutions":[210],"approach,":[211],"enables":[213],"us":[214,300],"construct":[216],"consistently":[223],"most":[226],"+":[228],"centers:":[230],"via":[231],"known":[232],"results,":[233],"already":[235],"runs":[241],"quasi-polynomial":[243],"time.":[244],"Second,":[245],"develop":[247],"tailored":[252],"stable":[254],"instances,":[255],"where":[256],"removing":[257],"center":[259],"optimal":[262],"solution":[263],"increases":[264],"cost":[266],"least":[269],"\u03c9(<sup>3</sup>/logn)":[271],"fraction.":[272],"Achieving":[273],"involves":[275],"several":[276],"ideas,":[277],"including":[278],"sampling":[280],"inspired":[282],"k-means++":[285],"reduction":[289],"submodular":[291],"optimization":[292],"subject":[293],"partition":[296],"matroid.":[297],"This":[298],"allows":[299],"convert":[302],"into":[306],"polynomial":[308],"time":[309],"while":[316],"maintaining":[317]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-06-16T00:00:00"}