{"id":"https://openalex.org/W4390490905","doi":"https://doi.org/10.1145/3639453","title":"Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor","display_name":"Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390490905","doi":"https://doi.org/10.1145/3639453"},"language":"en","primary_location":{"id":"doi:10.1145/3639453","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639453","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639453","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3639453","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-0779-8962","affiliations":[{"raw_affiliation_string":"Google Research, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004420568","display_name":"Debarati Das","orcid":"https://orcid.org/0000-0003-2232-4279"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Debarati Das","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2232-4279","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014402783","display_name":"Evangelos Kipouridis","orcid":"https://orcid.org/0000-0002-5830-5830"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Evangelos Kipouridis","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-5830-5830","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062582508","display_name":"Nikos Parotsidis","orcid":"https://orcid.org/0000-0003-3888-7391"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Nikos Parotsidis","raw_affiliation_strings":["Google Research, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-3888-7391","affiliations":[{"raw_affiliation_string":"Google Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-5237-1709","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5074251728"],"corresponding_institution_ids":["https://openalex.org/I4210100430"],"apc_list":null,"apc_paid":null,"fwci":0.3205,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59576709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"71","issue":"2","first_page":"1","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/constant","display_name":"Constant (computer programming)","score":0.6563674807548523},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5912911891937256},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.5236384868621826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5165356993675232},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4764840304851532},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40073516964912415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3665716052055359},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23998817801475525}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6563674807548523},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5912911891937256},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.5236384868621826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5165356993675232},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4764840304851532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40073516964912415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3665716052055359},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23998817801475525},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3639453","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639453","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639453","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/8d288d48-abc7-414f-bcef-c7ac16ee5937","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/8d288d48-abc7-414f-bcef-c7ac16ee5937","pdf_url":"https://curis.ku.dk/ws/files/391118908/Fitting_Distances.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cohen-Addad , V , Das , D , Kipouridis , E , Parotsidis , N & Thorup , M 2024 , ' Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor ' , Journal of the ACM , vol. 71 , no. 2 , 10 . https://doi.org/10.1145/3639453","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3639453","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639453","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639453","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2028424385","display_name":null,"funder_award_id":"801199","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"},{"id":"https://openalex.org/F4320337079","display_name":"Basic Algorithms Research Copenhagen, University of Copenhagen","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390490905.pdf","grobid_xml":"https://content.openalex.org/works/W4390490905.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1546944601","https://openalex.org/W1565519167","https://openalex.org/W1973264045","https://openalex.org/W1973912434","https://openalex.org/W1981651876","https://openalex.org/W1982119153","https://openalex.org/W1985064024","https://openalex.org/W1995848967","https://openalex.org/W2066936587","https://openalex.org/W2084329948","https://openalex.org/W2088481129","https://openalex.org/W2088484367","https://openalex.org/W2091858563","https://openalex.org/W2146081992","https://openalex.org/W2150148016","https://openalex.org/W2161719898","https://openalex.org/W2165879774","https://openalex.org/W2323517320","https://openalex.org/W2327490853","https://openalex.org/W2914959486","https://openalex.org/W2951747536","https://openalex.org/W2999484166","https://openalex.org/W3030774092","https://openalex.org/W3136367277","https://openalex.org/W4236653231","https://openalex.org/W4243637616","https://openalex.org/W4288043217","https://openalex.org/W4293052628","https://openalex.org/W4319054025","https://openalex.org/W6840848399"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4409439182","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"We":[0,22,77,94,109],"consider":[1,78],"the":[2,35,57,67,79,84,102,119,128,146],"numerical":[3],"taxonomy":[4],"problem":[5],"of":[6,86,92,122],"fitting":[7],"a":[8,19,24,96,106,125,142,185],"positive":[9,28],"distance":[10,87,130],"function":[11],"\\({\\mathcal":[12],"{D}:{S\\choose":[13],"2}\\rightarrow":[14],"\\mathbb":[15],"{R}_{\\gt":[16],"0}}\\)":[17],"by":[18,168],"tree":[20,25,58],"metric.":[21],"want":[23],"T":[26,42,59],"with":[27,124],"edge":[29],"weights":[30],"and":[31,74,117,170],"including":[32],"S":[33,135],"among":[34],"vertices":[36,133],"so":[37,141],"that":[38,82],"their":[39],"distances":[40,69],"in":[41,45,53,70,134,152],"match":[43],"those":[44],"\\(\\mathcal":[46,71],"{D}\\)":[47,72],".":[48,136],"A":[49],"nice":[50],"application":[51],"is":[52,145,184],"evolutionary":[54],"biology":[55],"where":[56],"aims":[60],"to":[61,66,131],"approximate":[62],"thebranching":[63],"process":[64],"leading":[65],"observed":[68],"[Cavalli-Sforza":[73],"Edwards":[75],"1967].":[76],"total":[80,103],"error,":[81],"is,":[83],"sum":[85],"errors":[88],"over":[89],"all":[90,132],"pairs":[91],"points.":[93],"present":[95],"deterministic":[97],"polynomial":[98,153],"time":[99],"algorithm":[100],"minimizing":[101],"error":[104],"within":[105],"constant":[107,143],"factor.":[108],"can":[110,149,181],"do":[111],"this":[112],"both":[113],"for":[114,118,151],"general":[115],"trees":[116],"special":[120],"case":[121],"ultrametrics":[123],"root":[126],"having":[127],"same":[129],"The":[137,155],"problems":[138],"are":[139],"APX-hard,":[140],"factor":[144,159],"best":[147,156],"we":[148],"hope":[150],"time.":[154],"previous":[157],"approximation":[158,180],"was":[160],"O":[161,178],"((log":[162],"n":[163,166],")(log":[164],"log":[165],"))":[167],"Ailon":[169],"Charikar":[171],"[2005],":[172],"who":[173],"wrote":[174],"\u201cdetermining":[175],"whether":[176],"an":[177],"(1)":[179],"be":[182],"obtained":[183],"fascinating":[186],"question.\u201d":[187]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-13T08:25:38.343686","created_date":"2025-10-10T00:00:00"}