{"id":"https://openalex.org/W4394883505","doi":"https://doi.org/10.1137/22m1544105","title":"Sublinear Time Approximation of the Cost of a Metric \\({k}\\)-Nearest Neighbor Graph","display_name":"Sublinear Time Approximation of the Cost of a Metric \\({k}\\)-Nearest Neighbor Graph","publication_year":2024,"publication_date":"2024-04-17","ids":{"openalex":"https://openalex.org/W4394883505","doi":"https://doi.org/10.1137/22m1544105"},"language":"en","primary_location":{"id":"doi:10.1137/22m1544105","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1544105","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/A5051815913","display_name":"Artur Czumaj","orcid":"https://orcid.org/0000-0002-7743-438X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Artur Czumaj","raw_affiliation_strings":["Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry CV4 7AL, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry CV4 7AL, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034247955","display_name":"Christian Sohler","orcid":"https://orcid.org/0000-0001-8990-3326"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Sohler","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Cologne, 50923 Cologne, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Cologne, 50923 Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051815913"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05198629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"2","first_page":"524","last_page":"571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6940548419952393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6194449663162231},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5896983742713928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5776528716087341},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5666893124580383},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5438131093978882},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4918684959411621},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4502784013748169},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4491337835788727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27941417694091797},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12281191349029541}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6940548419952393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6194449663162231},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5896983742713928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5776528716087341},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5666893124580383},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5438131093978882},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4918684959411621},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4502784013748169},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4491337835788727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27941417694091797},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12281191349029541},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/22m1544105","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1544105","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:wrap.warwick.ac.uk:182292","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2774561655","display_name":null,"funder_award_id":"EP/V01305X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3046054759","display_name":null,"funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8657054497","display_name":"Sublinear Algorithms for Big Graphs","funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320307762","display_name":"International Business Machines Corporation","ror":"https://ror.org/05hh8d621"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320336287","display_name":"Centre for Discrete Mathematics and its Applications, University of Warwick","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1928812145","https://openalex.org/W1963750764","https://openalex.org/W2001141328","https://openalex.org/W2001342485","https://openalex.org/W2038276547","https://openalex.org/W2055032836","https://openalex.org/W2058295780","https://openalex.org/W2063522056","https://openalex.org/W2082227928","https://openalex.org/W2104648144","https://openalex.org/W2121947440","https://openalex.org/W2132914434","https://openalex.org/W2964292992","https://openalex.org/W3021019285","https://openalex.org/W3090803701"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455","https://openalex.org/W2119808169"],"abstract_inverted_index":{"Let":[0],"(X,d)":[1,10,45,97,206],"be":[2],"an":[3,53,106,123,156,238],"n-point":[4],"metric":[5,95,204],"space.":[6],"We":[7,62,120,195],"assume":[8],"that":[9,18,51,98,108,125,150,161,197,200],"is":[11,46,103],"given":[12,90,203],"in":[13,36,84,126,151],"the":[14,67,79,94,114,176,179],"distance":[15,34],"oracle":[16,91],"model,":[17],"is,":[19],"X-{1,...,n}":[20],"and":[21],"for":[22,44,201],"every":[23],"pair":[24],"of":[25,57,69,72,81,140,159,178,183,207],"points":[26],"x,y":[27],"from":[28],"X":[29],"we":[30,77,88,143,186],"can":[31],"query":[32],"their":[33],"d(x,y)":[35],"constant":[37],"time.":[38,224,250],"A":[39],"k-nearest":[40],"neighbor":[41],"(k-NN)":[42],"graph":[43,49],"a":[47,138,145,202,219],"directed":[48],"G-(V,E)":[50],"has":[52],"eduge":[54],"to":[55,65,93,104,117,136,217,236],"each":[56],"v's":[58],"ka":[59],"nearest":[60],"neighbors.":[61],"use":[63],"cost(G)":[64,83,135,160,216,235],"denote":[66],"sum":[68],"edge":[70],"weights":[71],"G.":[73,100,119],"In":[74],"this":[75,110],"paper,":[76],"study":[78],"problem":[80,111],"approximating":[82],"sublinear":[85,148],"time":[86,115,128,152],"when":[87],"are":[89],"access":[92],"space":[96,205],"defines":[99],"Our":[101],"goal":[102],"develop":[105],"algorithm":[107,124,149,199,227],"solves":[109],"faster":[112],"than":[113],"required":[116],"compute":[118],"first":[121],"present":[122,144],"\u00d5\u03b5(n^2/k)":[127],"with":[129,163,190,210,229],"probability":[130,164,211,230],"at":[131,165,212,231],"least":[132,166,213,232],"2/3":[133,167,233],"approximates":[134],"within":[137,218],"factor":[139,221],"1+\u03b5.":[141],"Next,":[142],"more":[146],"elaborate":[147],"\u00d5\u03b5(min{nk^3/2,":[153],"n^2/k})":[154,249],"computes":[155],"estimate":[157],"cost":[158,177],"satisfies":[162],"|cost(G)":[168],"-":[169],"cost|\u2264\u03b5":[170],"\u22c5":[171,243],"(cost(G)+mst(X)),":[172],"where":[173],"mst(X)":[174],"denotes":[175],"minimum":[180],"spanning":[181],"tree":[182],"(X,d).":[184],"Further,":[185],"complement":[187],"these":[188],"results":[189],"near":[191],"matching":[192],"lower":[193],"bounds.":[194],"show":[196],"any":[198,226],"size":[208],"n,":[209],"2/3,":[214],"estimates":[215,234],"1+\u03b5":[220],"requires":[222,247],"\u03a9(n^2/k)":[223],"Similarly,":[225],"taht":[228],"wtihin":[237],"additive":[239],"error":[240],"term":[241],"\u03b5":[242],"(mst(X)":[244],"+":[245],"cost(X))":[246],"\u03a9\u03b5(min{nk^3/2,":[248]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}