84 search results - page 10 / 17 » A Constant Factor Approximation Algorithm for Generalized Mi... |
113
click to vote
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
140
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
129
Voted
WADS
1997
Springer
15 years 6 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
127
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
124
click to vote
COR
2007
15 years 2 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...