12519 search results - page 40 / 2504 » Approximation Problems Categories |
113
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
148
Voted
WDAG
2009
Springer
15 years 9 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,...
102
click to vote
IPL
2006
15 years 2 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
88
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
95
Voted
FCT
2003
Springer
15 years 7 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...