7006 search results - page 4 / 1402 » Approximation Algorithms |
138
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
107
Voted
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
114
Voted
WDAG
2009
Springer
15 years 6 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,...
66
Voted
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...