369 search results - page 1 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
ASIAN
1999
Springer
13 years 9 months ago
1999
Springer
RSA
2008
13 years 4 months ago
2008
EVOW
2004
Springer
13 years 10 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...