Abstract
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].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
