{"id":"https://openalex.org/W2001342485","doi":"https://doi.org/10.1137/060672121","title":"Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time","display_name":"Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2001342485","doi":"https://doi.org/10.1137/060672121","mag":"2001342485"},"language":"en","primary_location":{"id":"doi:10.1137/060672121","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060672121","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":["A.Czumaj@warwick.ac.uk#TAB#"],"affiliations":[{"raw_affiliation_string":"A.Czumaj@warwick.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034247955","display_name":"Christian Sohler","orcid":"https://orcid.org/0000-0001-8990-3326"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian Sohler","raw_affiliation_strings":["christian.sohler@tu-dortmund.de#TAB#"],"affiliations":[{"raw_affiliation_string":"christian.sohler@tu-dortmund.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051815913"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8885,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.9326598,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"3","first_page":"904","last_page":"922"},"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.9998999834060669,"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.9998999834060669,"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.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9947999715805054,"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/sublinear-function","display_name":"Sublinear function","score":0.8619869947433472},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7486664652824402},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7461369633674622},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.730825662612915},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6834716796875},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5899046063423157},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5469217896461487},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5340681672096252},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5081584453582764},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4883849024772644},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48752161860466003},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4826681911945343},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4480201303958893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4476293623447418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22319281101226807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09224912524223328}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8619869947433472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7486664652824402},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7461369633674622},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.730825662612915},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6834716796875},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5899046063423157},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5469217896461487},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5340681672096252},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5081584453582764},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4883849024772644},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48752161860466003},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4826681911945343},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4480201303958893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4476293623447418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22319281101226807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09224912524223328},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":3,"locations":[{"id":"doi:10.1137/060672121","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060672121","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.218.8518","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.8518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.njit.edu/~czumaj/PUBLICATIONS/MyPublications/STOC-2004-ACM.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.895","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.njit.edu/~czumaj/PUBLICATIONS/Metric-MST-pre-STOC-2004.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6958986694","display_name":null,"funder_award_id":"EP/D063191/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1963750764","https://openalex.org/W1965525854","https://openalex.org/W1970630090","https://openalex.org/W1979750072","https://openalex.org/W1980155175","https://openalex.org/W1985992848","https://openalex.org/W2031671531","https://openalex.org/W2039221685","https://openalex.org/W2054011861","https://openalex.org/W2075328466","https://openalex.org/W2082227928","https://openalex.org/W2138304862"],"related_works":["https://openalex.org/W2186461377","https://openalex.org/W8653221","https://openalex.org/W3021529782","https://openalex.org/W3016811403","https://openalex.org/W1531571111","https://openalex.org/W2109692093","https://openalex.org/W1564950490","https://openalex.org/W2349211578","https://openalex.org/W2899787781","https://openalex.org/W2950675557"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,93,111,118],"sublinear-time":[6],"$(1+\\varepsilon)$-approximation":[7],"randomized":[8],"algorithm":[9,29,49,59,90,107],"to":[10,54,68,80],"estimate":[11],"the":[12,15,28,33,45,55,73,76,121],"weight":[13,74,115],"of":[14,19,27,36,42,47,75],"minimum":[16,77],"spanning":[17,78,112],"tree":[18,79,113],"an":[20,37],"n-point":[21,38],"metric":[22,39],"space.":[23],"The":[24],"running":[25],"time":[26,72],"is":[30,41,50,60,65,116],"$\\widetilde{\\mathcal{O}}(n/\\varepsilon^{\\mathcal{O}(1)})$.":[31],"Since":[32],"full":[34],"description":[35],"space":[40],"size":[43],"$\\Theta(n^2)$,":[44],"complexity":[46],"our":[48],"sublinear":[51],"with":[52],"respect":[53],"input":[56],"size.":[57],"Our":[58],"almost":[61],"optimal":[62],"as":[63],"it":[64,99],"not":[66],"possible":[67],"approximate":[69],"in":[70,95],"$o(n)$":[71],"within":[81,117],"any":[82],"factor.":[83],"We":[84],"also":[85],"show":[86],"that":[87,104,109],"no":[88,105],"deterministic":[89],"can":[91],"achieve":[92],"B-approximation":[94],"$o(n^2/B^3)$":[96],"time.":[97],"Furthermore,":[98],"has":[100],"been":[101],"previously":[102],"shown":[103],"$o(n^2)$":[106],"exists":[108],"returns":[110],"whose":[114],"constant":[119],"times":[120],"optimum.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}