1161 search results - page 15 / 233 » Approximation schemes for clustering problems |
108
click to vote
WADS
2007
Springer
15 years 3 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
115
click to vote
MLDM
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
PAMI
2010
14 years 8 months ago
2010
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...