{"id":"https://openalex.org/W4386506898","doi":"https://doi.org/10.1142/s0129054123500181","title":"Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces","display_name":"Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces","publication_year":2023,"publication_date":"2023-09-07","ids":{"openalex":"https://openalex.org/W4386506898","doi":"https://doi.org/10.1142/s0129054123500181"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054123500181","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054123500181","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5043499853","display_name":"Ching-Lueh Chang","orcid":"https://orcid.org/0000-0001-5039-4608"},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ching-Lueh Chang","raw_affiliation_strings":["Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan"],"raw_orcid":"https://orcid.org/0000-0001-5039-4608","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I99908691"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005036381","display_name":"Chun\u2010Wei Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chun-Wei Chang","raw_affiliation_strings":["Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan","MS student at the time of submitting this paper, Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I99908691"]},{"raw_affiliation_string":"MS student at the time of submitting this paper, Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I99908691"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043499853"],"corresponding_institution_ids":["https://openalex.org/I99908691"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17873739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"05","first_page":"595","last_page":"603"},"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.9987000226974487,"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.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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.9983000159263611,"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/mathematics","display_name":"Mathematics","score":0.6311194896697998},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.618410050868988},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5411909818649292},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4815804958343506},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47575634717941284},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4208933711051941},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4145636558532715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36340194940567017},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06450799107551575}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6311194896697998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.618410050868988},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5411909818649292},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4815804958343506},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47575634717941284},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4208933711051941},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4145636558532715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36340194940567017},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06450799107551575},{"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":1,"locations":[{"id":"doi:10.1142/s0129054123500181","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054123500181","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2001907516","https://openalex.org/W2595897327","https://openalex.org/W3174842734","https://openalex.org/W4214773521","https://openalex.org/W4243936346","https://openalex.org/W4302604684"],"related_works":["https://openalex.org/W2376029318","https://openalex.org/W2388301251","https://openalex.org/W2013770701","https://openalex.org/W3013941779","https://openalex.org/W1998659141","https://openalex.org/W3195376785","https://openalex.org/W2951185269","https://openalex.org/W2319937810","https://openalex.org/W2370435933","https://openalex.org/W2947625790"],"abstract_inverted_index":{"Consider":[0],"the":[1,47],"problem":[2,32,51],"of":[3,111],"finding":[4,107],"a":[5,19,35,45,56,68,81,95,99,108],"point":[6,14,82],"furthest":[7],"from":[8],"[Formula:":[9,15,22,26,37,40,58,61,71,78,83,87,91,102,115,119],"see":[10,16,23,27,38,41,59,62,72,79,84,88,92,103,116,120],"text]":[11,17,85,117],"for":[12,76,106],"each":[13,77],"in":[18,52,118],"metric":[20,53],"space":[21],"text],":[24,80,89],"where":[25,90],"text].":[28,93,121],"We":[29,65],"prove":[30],"this":[31],"to":[33],"have":[34,98],"deterministic":[36,57],"text]-time":[39,60,73,104],"text]-approximation":[42,63],"algorithm.":[43,64],"As":[44,94],"corollary,":[46,96],"maximum":[48],"spanning":[49,109],"tree":[50,110],"spaces":[54],"has":[55],"also":[66],"give":[67],"Monte":[69,100],"Carlo":[70,101],"algorithm":[74,105],"outputting,":[75],"satisfying":[86],"we":[97],"weight":[112],"at":[113],"least":[114]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}