On approximating metric 1-median in sublinear time |
| |
Authors: | Bang Ye Wu |
| |
Affiliation: | Dept. of Computer Science and Information Engineering, National Chung Cheng University, ChiaYi, 621 Taiwan, ROC |
| |
Abstract: | This paper focuses on approximating the metric 1-median problem with sublinear number of queries and time complexity. We first show a simper proof of the currently best 4-approximation algorithm, and then propose a recursive algorithm. For any integer h?2, the algorithm finds a 2h -approximation solution with O(n1+1/h) queries and time complexity. |
| |
Keywords: | Metric 1-median Approximation algorithms Sublinear time algorithm |
本文献已被 ScienceDirect 等数据库收录! |
|