{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:03:45Z","timestamp":1649070225448},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our techniques with core-sets for approximate unweighted farthest neighbors, we show how to find approximate farthest neighbors that are farther than a factor (1 - \u220a) of optimal in time O( log n) per query in D-dimensional Euclidean space for any constants D and \u220a. As an application, we find an O(n log n) expected time algorithm for choosing the center of a star topology network connecting a given set of points, so as to approximately minimize the maximum dilation between any pair of points. <\/jats:p>","DOI":"10.1142\/s1793830910000887","type":"journal-article","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T03:21:26Z","timestamp":1295234486000},"page":"553-565","source":"Crossref","is-referenced-by-count":0,"title":["APPROXIMATE WEIGHTED FARTHEST NEIGHBORS AND MINIMUM DILATION STARS"],"prefix":"10.1142","volume":"02","author":[{"given":"JOHN","family":"AUGUSTINE","sequence":"first","affiliation":[{"name":"School of Physical &amp; Mathematical Sciences, Nanyang Technological University, Singapore 637371, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID","family":"EPPSTEIN","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of California, Irvine, Irvine, CA 92697, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KEVIN A.","family":"WORTMAN","sequence":"additional","affiliation":[{"name":"Computer Science Department, California State University, Fullerton, Fullerton, CA 92831, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf1","unstructured":"P. K.\u00a0Agarwal, S.\u00a0Har-Peled and K. R.\u00a0Varadarajan, Combinatorial and Computational Geometry, eds. J. E.\u00a0Goodman, J.\u00a0Pach and E.\u00a0Welzl (Cambridge University Press, 2005)\u00a0pp. 1\u201330."},{"key":"rf2","doi-asserted-by":"crossref","unstructured":"S.\u00a0Arya and D.\u00a0Mount, Handbook of Data Structures and Applications, eds. D. P.\u00a0Mehta and S.\u00a0Sahni (CRC Press, 2005)\u00a0pp. 63.1\u201363.22.","DOI":"10.1201\/9781420035179.ch63"},{"key":"rf4","doi-asserted-by":"crossref","unstructured":"C.\u00a0Duncan and M. T.\u00a0Goodrich, Handbook of Data Structures and Applications, eds. D. P.\u00a0Mehta and S.\u00a0Sahni (CRC Press, 2005)\u00a0pp. 26.1\u201326.17.","DOI":"10.1201\/9781420035179.ch26"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:16:04Z","timestamp":1565097364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":3,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S1793830910000887"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000887","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}