5595 search results - page 118 / 1119 » Approximation Algorithms for Clustering Problems |
162
Voted
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
147
click to vote
ACMSE
2010
ACM
15 years 2 months ago
2010
ACM
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
155
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
149
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
167
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...