{"id":"https://openalex.org/W2153586414","doi":"https://doi.org/10.1007/3-540-45753-4_14","title":"Facility Location and the Geometric Minimum-Diameter Spanning Tree","display_name":"Facility Location and the Geometric Minimum-Diameter Spanning Tree","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2153586414","doi":"https://doi.org/10.1007/3-540-45753-4_14","mag":"2153586414"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45753-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45753-4_14","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/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Joachim Gudmundsson","raw_affiliation_strings":["Dept.of Comp.Science, Utrecht University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Dept.of Comp.Science, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083767409","display_name":"Herman Haverkort","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Herman Haverkort","raw_affiliation_strings":["Dept.of Comp.Science, Utrecht University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Dept.of Comp.Science, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041860681","display_name":"Sang\u2010Min Park","orcid":"https://orcid.org/0000-0003-2915-0742"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sang-Min Park","raw_affiliation_strings":["Dept.of Comp.Science, KAIST, Korea"],"affiliations":[{"raw_affiliation_string":"Dept.of Comp.Science, KAIST, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042351684","display_name":"Chan-Su Shin","orcid":"https://orcid.org/0000-0003-3073-6863"},"institutions":[{"id":"https://openalex.org/I83436808","display_name":"Hankuk University of Foreign Studies","ror":"https://ror.org/051q2m369","country_code":"KR","type":"education","lineage":["https://openalex.org/I83436808"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chan-Su Shin","raw_affiliation_strings":["School of Electr. and Inform.Engineering, Hankuk University of Foreign Studies, Korea"],"affiliations":[{"raw_affiliation_string":"School of Electr. and Inform.Engineering, Hankuk University of Foreign Studies, Korea","institution_ids":["https://openalex.org/I83436808"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014138072","display_name":"Alexander Wolff","orcid":"https://orcid.org/0000-0001-5872-718X"},"institutions":[{"id":"https://openalex.org/I36522303","display_name":"Universit\u00e4t Greifswald","ror":"https://ror.org/00r1edq15","country_code":"DE","type":"education","lineage":["https://openalex.org/I36522303"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Wolff","raw_affiliation_strings":["Institut f\u00fcr Mathematikund Informatik, Universit\u00e4t Greifswald, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematikund Informatik, Universit\u00e4t Greifswald, Germany","institution_ids":["https://openalex.org/I36522303"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5087003217"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1543,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75139665,"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":"146","last_page":"160"},"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.9997000098228455,"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.9997000098228455,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.640206515789032},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.584967315196991},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5245580673217773},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4794375002384186},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.45949676632881165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4427310824394226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3234619200229645},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.08654388785362244}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.640206515789032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.584967315196991},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5245580673217773},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4794375002384186},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.45949676632881165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4427310824394226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3234619200229645},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.08654388785362244},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-45753-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45753-4_14","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:pure.tue.nl:openaire_cris_publications/5e0c07c2-5792-4cbd-9c11-82e04e2a3d3f","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/5e0c07c2-5792-4cbd-9c11-82e04e2a3d3f","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gudmundsson, J, Haverkort, H J, Park, S M, Shin, C S & Wolff, A 2002, Facility location and the geometric minimum-diameter spanning tree. in K Jansen, S Leonardi & V Vazirani (eds), Approximation algorithms for combinatorial optimization : proceedings APPROX 2002, Rome Italy, september 17-21, 2002. Lecture Notes in Computer Science, vol. 2462, Springer, Berlin, pp. 146-160. https://doi.org/10.1007/3-540-45753-4_14","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/5e0c07c2-5792-4cbd-9c11-82e04e2a3d3f","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/5e0c07c2-5792-4cbd-9c11-82e04e2a3d3f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Approximation algorithms for combinatorial optimization : proceedings APPROX 2002, Rome Italy, september 17-21, 2002, 146 - 160","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W9716439","https://openalex.org/W1985149601","https://openalex.org/W1992129184","https://openalex.org/W2004681879","https://openalex.org/W2011039300","https://openalex.org/W2022307052","https://openalex.org/W2029814178","https://openalex.org/W2032966476","https://openalex.org/W2034834234","https://openalex.org/W2054011861","https://openalex.org/W2079872371","https://openalex.org/W2086252334","https://openalex.org/W2163294576","https://openalex.org/W2476096155","https://openalex.org/W2752885492","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}