{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:26:16Z","timestamp":1747189576515,"version":"3.40.5"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"name":"National Science and Technology Council, Taiwan","award":["111-2221-E-155-035-MY2"],"award-info":[{"award-number":["111-2221-E-155-035-MY2"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p> Consider the problem of finding a point furthest from [Formula: see text] for each point [Formula: see text] in a metric space [Formula: see text], where [Formula: see text]. We prove this problem to have a deterministic [Formula: see text]-time [Formula: see text]-approximation algorithm. As a corollary, the maximum spanning tree problem in metric spaces has a deterministic [Formula: see text]-time [Formula: see text]-approximation algorithm. We also give a Monte Carlo [Formula: see text]-time algorithm outputting, for each [Formula: see text], a point [Formula: see text] satisfying [Formula: see text], where [Formula: see text]. As a corollary, we have a Monte Carlo [Formula: see text]-time algorithm for finding a spanning tree of weight at least [Formula: see text] in [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054123500181","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T09:22:36Z","timestamp":1694078556000},"page":"595-603","source":"Crossref","is-referenced-by-count":0,"title":["Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces"],"prefix":"10.1142","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5039-4608","authenticated-orcid":false,"given":"Ching-Lueh","family":"Chang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan"}]},{"given":"Chun-Wei","family":"Chang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Yuan Ze University, Taoyuan, Taiwan"}]}],"member":"219","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"S0129054123500181BIB001","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch28"},{"key":"S0129054123500181BIB002","doi-asserted-by":"publisher","DOI":"10.1137\/18M1226737"},{"key":"S0129054123500181BIB003","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.78"},{"key":"S0129054123500181BIB004","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301366"},{"key":"S0129054123500181BIB006","volume-title":"Principles of Mathematical Analysis.","author":"Rudin W.","year":"1976","edition":"3"},{"key":"S0129054123500181BIB007","doi-asserted-by":"publisher","DOI":"10.1201\/9780203497289"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054123500181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T03:06:25Z","timestamp":1720494385000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054123500181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":6,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1142\/S0129054123500181"],"URL":"https:\/\/doi.org\/10.1142\/s0129054123500181","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2023,9,7]]}}}