5595 search results - page 115 / 1119 » Approximation Algorithms for Clustering Problems |
123
click to vote
IPL
2006
15 years 4 months ago
2006
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
158
click to vote
IEICET
2010
15 years 2 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
141
click to vote
SIGPRO
2011
14 years 11 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
166
click to vote
SWAT
2010
Springer
15 years 10 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
138
click to vote
PAKDD
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...