{"id":"https://openalex.org/W1526220139","doi":"https://doi.org/10.1007/3-540-48224-5_16","title":"Approximating the Minimum Spanning Tree Weight in Sublinear Time","display_name":"Approximating the Minimum Spanning Tree Weight in Sublinear Time","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1526220139","doi":"https://doi.org/10.1007/3-540-48224-5_16","mag":"1526220139"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5044565966","display_name":"Bernard Chazelle","orcid":"https://orcid.org/0000-0001-8542-0247"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernard Chazelle","raw_affiliation_strings":["Princeton University and NEC Research Institute, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University and NEC Research Institute, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041567023","display_name":"Ronitt Rubinfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronitt Rubinfeld","raw_affiliation_strings":["NEC Research Institute, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Research Institute, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057752375","display_name":"Luca Trevisan","orcid":"https://orcid.org/0000-0002-6982-8530"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luca Trevisan","raw_affiliation_strings":["U.C. Berkeley, Berkeley, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"U.C. Berkeley, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.7427,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.81703322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"190","last_page":"200"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.8172338604927063},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7187767624855042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7072492837905884},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.632197916507721},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5676487684249878},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45157143473625183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30358341336250305},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2767941951751709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20185822248458862}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8172338604927063},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7187767624855042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7072492837905884},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.632197916507721},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5676487684249878},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45157143473625183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30358341336250305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2767941951751709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20185822248458862}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-48224-5_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.6507","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.6507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/courses/archive/spring04/cos598B/bib/ChazelleRT-mst.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.8809","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://external.nj.nec.com/homepages/ronitt/papers/mst.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.3177","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.3177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~chazelle/pubs/mstapprox.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W168125756","https://openalex.org/W1599814229","https://openalex.org/W1673477340","https://openalex.org/W1952127226","https://openalex.org/W1970630090","https://openalex.org/W1980816908","https://openalex.org/W2018925011","https://openalex.org/W2032841680","https://openalex.org/W2050516752","https://openalex.org/W2056168287","https://openalex.org/W2072858942","https://openalex.org/W2074286662","https://openalex.org/W2087216833","https://openalex.org/W2095962154","https://openalex.org/W2106000336","https://openalex.org/W2136499036","https://openalex.org/W2138304862","https://openalex.org/W2156516121","https://openalex.org/W2164485560","https://openalex.org/W4254343065"],"related_works":["https://openalex.org/W2186461377","https://openalex.org/W8653221","https://openalex.org/W2349211578","https://openalex.org/W3021529782","https://openalex.org/W3016811403","https://openalex.org/W2109692093","https://openalex.org/W2803918337","https://openalex.org/W2899787781","https://openalex.org/W2379753072","https://openalex.org/W2069416867"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}