{"id":"https://openalex.org/W1550664436","doi":"https://doi.org/10.1007/11429647_9","title":"Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances","display_name":"Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1550664436","doi":"https://doi.org/10.1007/11429647_9","mag":"1550664436"},"language":"en","primary_location":{"id":"doi:10.1007/11429647_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11429647_9","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":"book-chapter","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/A5001082357","display_name":"Andrea Clementi","orcid":"https://orcid.org/0000-0002-9521-2457"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea E. F. Clementi","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\u201cTor Vergata\u201d, Via della Ricerca Scientifica 1, 00133, Roma, Italy","Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\"Tor Vergata\", Via della Ricerca Scientifica 1, 00133, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\u201cTor Vergata\u201d, Via della Ricerca Scientifica 1, 00133, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\"Tor Vergata\", Via della Ricerca Scientifica 1, 00133, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014515479","display_name":"Miriam Di Ianni","orcid":"https://orcid.org/0000-0002-1699-5802"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Miriam Di Ianni","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\u201cTor Vergata\u201d, Via della Ricerca Scientifica 1, 00133, Roma, Italy","Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\"Tor Vergata\", Via della Ricerca Scientifica 1, 00133, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\u201cTor Vergata\u201d, Via della Ricerca Scientifica 1, 00133, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\"Tor Vergata\", Via della Ricerca Scientifica 1, 00133, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027315672","display_name":"Angelo Monti","orcid":"https://orcid.org/0000-0002-3309-8249"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Angelo Monti","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \"La Sapienza\", Via Salaria 113, 00198, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \"La Sapienza\", Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024267515","display_name":"Massimo Lauria","orcid":"https://orcid.org/0000-0003-4003-3168"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo Lauria","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \"La Sapienza\", Via Salaria 113, 00198, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \"La Sapienza\", Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062564113","display_name":"Gianluca Del Rossi","orcid":"https://orcid.org/0000-0002-6440-8203"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluca Rossi","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\u201cTor Vergata\u201d, Via della Ricerca Scientifica 1, 00133, Roma, Italy","Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\"Tor Vergata\", Via della Ricerca Scientifica 1, 00133, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\u201cTor Vergata\u201d, Via della Ricerca Scientifica 1, 00133, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma\"Tor Vergata\", Via della Ricerca Scientifica 1, 00133, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056847255","display_name":"Riccardo Silvestri","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Riccardo Silvestri","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \"La Sapienza\", Via Salaria 113, 00198, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Roma \"La Sapienza\", Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5001082357"],"corresponding_institution_ids":["https://openalex.org/I116067653"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.406,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87473904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"89","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9970999956130981,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7110867500305176},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6964585185050964},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.6631506085395813},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6595544219017029},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6407776474952698},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6355520486831665},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5521643161773682},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5475739240646362},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5145946741104126},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4965415596961975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4784438908100128},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4518333673477173},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.43063247203826904},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4187484383583069},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3825443685054779},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26069095730781555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1898212730884552}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7110867500305176},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6964585185050964},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.6631506085395813},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6595544219017029},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6407776474952698},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6355520486831665},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5521643161773682},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5475739240646362},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5145946741104126},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4965415596961975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4784438908100128},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4518333673477173},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.43063247203826904},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4187484383583069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3825443685054779},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26069095730781555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1898212730884552},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11429647_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11429647_9","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:iris.uniroma1.it:11573/366647","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/366647","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W56883693","https://openalex.org/W1594704917","https://openalex.org/W1696776098","https://openalex.org/W1967079221","https://openalex.org/W1977541023","https://openalex.org/W1977712294","https://openalex.org/W1991421283","https://openalex.org/W2019067222","https://openalex.org/W2024315858","https://openalex.org/W2052035035","https://openalex.org/W2057725412","https://openalex.org/W2076746184","https://openalex.org/W2101622070","https://openalex.org/W2102224076","https://openalex.org/W2103955286","https://openalex.org/W2105867954","https://openalex.org/W2115831664","https://openalex.org/W2140606557","https://openalex.org/W2157424698","https://openalex.org/W2166775052","https://openalex.org/W2168987613","https://openalex.org/W2295428206","https://openalex.org/W2608158342","https://openalex.org/W2809211406","https://openalex.org/W2989661724","https://openalex.org/W3148765228","https://openalex.org/W4231916799","https://openalex.org/W4234408051","https://openalex.org/W4243637616","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1868361628","https://openalex.org/W2074881724","https://openalex.org/W1971779258","https://openalex.org/W1550664436","https://openalex.org/W2055362092","https://openalex.org/W2294107416","https://openalex.org/W278944754","https://openalex.org/W2039405536","https://openalex.org/W2165923003","https://openalex.org/W2025373161"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}