| M. Junger. Personal communication, 1994. |
....9 4 , for a ratio of 8 9 = 0:8889. Homer and Peinado [34] have implemented our algorithm on a CM 5, and have shown that it produces optimal or very nearly optimal solutions to a number of MAX CUT instances derived from via minimization problems. These instances were provided by Michael Junger [35] and have between 828 and 1366 vertices. 6 Generalizations We can use the same technique as in Section 1 to approximate several other problems. In the next section we describe a variation of MAX CUT and give an (ff Gamma ffl) approximation algorithm for it. In Section 6.2 we give an (ff Gamma ....
M. Junger. Personal communication, 1994.
....= 9 4 , for a ratio of 8 9 = 0:8889. Homer and Peinado [24] have implemented our algorithm on a CM 5, and have shown that it produces optimal or very nearly optimal solutions to a number of MAX CUT instances derived from via minimization problems. These instances were provided by Michael Junger [25] and have between 828 and 1366 vertices. 5 Derandomization The algorithm can be derandomized, resulting in a deterministic (ff Gamma ffl) approximation algorithm for any ffl 0. The method we use is the classical method of conditional expectations. Assume we are given a set of unit vectors v 1 ....
M. Junger. Personal communication, 1994.
No context found.
M. Junger. Personal communication, 1994.
No context found.
M. Junger. Personal communication, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC