5595 search results - page 90 / 1119 » Approximation Algorithms for Clustering Problems |
147
click to vote
ECCC
2007
15 years 6 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
152
click to vote
PAKDD
2005
ACM
16 years 2 days ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
167
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
176
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
181
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...