An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem
نویسندگان
چکیده
A randomizing algorithm for the weighted Euclidean 1-center problem is pre-xnted. The algorithm is shown to run on any problem in O (n log P I) time with high probability.
منابع مشابه
Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملEfficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph
In this paper, we provide efficient algorithms for solving the weighted center problems in a cactus graph. In particular, an O(n log n) time algorithm is proposed that finds the weighted 1-center in a cactus graph, where n is the number of vertices in the graph. For the weighted 2-center problem, an O(n log n) time algorithm is devised for its continuous version and showed that its discrete ver...
متن کاملEfficient algorithms for center problems in cactus networks
Efficient algorithms for solving the center problems in weighted cactus networks are presented. In particular, we have proposed the following algorithms for the weighted cactus networks of size n: an O(n log n) time algorithm to solve the 1center problem, an O(n log 3n) time algorithm to solve the weighted continuous 2-center problem. We have also provided improved solutions to the general p-ce...
متن کاملApproximate Weighted Farthest Neighbors and Minimum Dilation Stars
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 (1+ ε)-approximate farthest neighbors in time O(logn) per query in D-dimensional Euclidean space for any constants D and ε. A...
متن کاملMinimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the sum of the n distances between matched pairs is minimized. The graph theoretic version of this problem has been extensively studied since the pioneering work of Edmonds. The best time bound known for MEWM is O(n 2:5 (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 7 شماره
صفحات -
تاریخ انتشار 1986