5595 search results - page 273 / 1119 » Approximation Algorithms for Clustering Problems |
167
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
157
click to vote
IWPC
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper describes a collection of algorithms that we developed and implemented to facilitate the automatic recovery of the modular structure of a software system from its sourc...
159
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
161
click to vote
CSDA
2010
15 years 6 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
183
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...