3894 search results - page 7 / 779 » Approximation Algorithms for Biclustering Problems |
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
104
click to vote
IPCO
2004
14 years 10 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
66
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
ISAAC
1995
Springer
15 years 1 months ago
1995
Springer
ESA
2008
Springer
14 years 11 months ago
2008
Springer