E. de Klerk, D. V. Pasechnik, and J. P. Warners. On approximate graph colouring and MAX- k-CUT algorithms based on the #-function. Manuscript, Oct. 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Algorithms for MAX-3-CUT and Other Problems.. - Goemans, Williamson (2002) (3 citations) (Correct)
....This compares with proven performance guarantees of .800217 for Max 3 Cut (by Frieze and Jerrum [9] and 3 10 for the general problem (by Andersson, Engebretsen, and H astad [3] It matches the guarantee of . 836008 for Max 3 Cut found independently by de Klerk, Pasechnik, and Warners [6]. We show that all these algorithms are in fact equivalent in the case of Max 3 Cut, and that our algorithm is the same as that of Andersson et al. in the more general case. 1 Introduction The uses of linear programming for designing algorithms for combinatorial optimization problems has long ....
....and Jerrum also use a (real) semide nite programming relaxation and we can show that in the case of Max 3 Cut, our complex relaxation and our rounding scheme is equivalent to theirs, and thus the performance guarantee of their algorithm is 0:836008. Independently, de Klerk, Pasechnik, and Warners [6] have shown numerically that the performance guarantee of Frieze and Jerrum is .836008. Since the appearance of an extended abstract of this paper [11] de Klerk and Pasechnik [5] have shown that the Frieze and Jerrum analysis also yields a performance guarantee of exactly . In terms of ....
[Article contains additional citation context not shown here]
E. de Klerk, D. V. Pasechnik, and J. P. Warners. On approximate graph colouring and MAX- k-CUT algorithms based on the #-function. Manuscript, Oct. 2000.
Approximation Algorithms for MAX-3-CUT and Other Problems.. - Goemans, Williamson (2001) (3 citations) (Correct)
....This compares with proven performance guarantees of .800217 for Max 3 Cut (by Frieze and Jerrum [9] and 1 3 10 8 for the general problem (by Andersson, Engebretsen, and Hastad [3] It matches the guarantee of . 836008 for Max 3 Cut found independently by de Klerk, Pasechnik, and Warners [6]. We show that all these algorithms are in fact equivalent in the case of Max 3 Cut, and that our algorithm is the same as that of Andersson et al. in the more general case. 1 Introduction The uses of linear programming for designing algorithms for combinatorial optimization problems has long ....
....and Jerrum also use a (real) semidefinite programming relaxation and we can show that in the case of Max 3 Cut, our complex relaxation and our rounding scheme is equivalent to theirs, and thus the performance guarantee of their algorithm is 0.836008. Independently, de Klerk, Pasechnik, and Warners [6] have shown numerically that the performance guarantee of Frieze and Jerrum is .836008. Since the appearance of an extended abstract of this paper [11] de Klerk and Pasechnik [5] have shown that the Frieze and Jerrum analysis also yields a performance guarantee of exactly # #. In terms of ....
[Article contains additional citation context not shown here]
E. de Klerk, D. V. Pasechnik, and J. P. Warners. On approximate graph colouring and MAX- k-CUT algorithms based on the #-function. Manuscript, Oct. 2000.
Approximation Algorithms for MAX-3-CUT and Other Problems.. - Goemans, Williamson (2001) (3 citations) (Correct)
....compares with proven performance guarantees of .800217 for Max 3 Cut (by Frieze and Jerrum [7] and 1 3 10 Gamma8 for the general problem (by Andersson, Engebretson, and Hastad [2] It matches the guarantee of . 836008 for Max 3 Cut found independently by de Klerk, Pasechnik, and Warners [4]. We show that all these algorithms are in fact identical in the case of Max 3 Cut. A current version of the paper can be found at www.almaden.ibm.com cs people dpw. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee ....
....and Jerrum also use a (real) semidefinite programming relaxation and we can show that in the case of Max 3 Cut, our complex relaxation and our rounding scheme is equivalent to theirs, and thus the performance guarantee of their algorithm is :83601. Independently, de Klerk, Pasechnik, and Warners [4] have shown that the performance guarantee of Frieze and Jerrum is .836008. In terms of negative results, Andersson et al. 2] have shown that no ff approximation algorithm for Max 2 Lin Mod 3 can have ff 17=18 :944 unless P = NP . Our use of complex semidefinite programming is in some sense ....
[Article contains additional citation context not shown here]
E. de Klerk, D. V. Pasechnik, and J. P. Warners. On approximate graph colouring and MAX-k-CUT algorithms based on the #-function. Manuscript, Oct. 2000.
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