5595 search results - page 201 / 1119 » Approximation Algorithms for Clustering Problems |
151
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
147
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
141
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
160
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
157
click to vote
ISSAC
1995
Springer
15 years 9 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...