Alan Frieze, Mark Jerrum  Home/Search
Context Related
| rutgers.edu/~alizadeh/Sdppag...k_cut.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~alizadeh/Sd...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks of equal cardinality, again so as to maximise the weight of crossing edges. The approach, pioneered by Goemans and Williamson, is via a semidefinite relaxation. 1 Introduction Goemans and... (Update)
Cited by: More
Unknown - (Correct)
Approximation of dense-n/2-subgraph and table compression problems - Xu, Han, Du (Correct)
On approximate graph colouring and MAX-k-CUT.. - de Klerk, Pasechnik.. (2000) (Correct)
Similar documents (at the sentence level):
59.7%: Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION - Frieze, Jerrum (1995) (Correct)
Active bibliography (related documents): More All
0.1: The Swendsen-Wang process does not always mix rapidly - Gore, Jerrum (1996) (Correct)
0.1: Trees and Matchings - Kenyon, Propp, Wilson (1999) (Correct)
0.1: Combinatorics Entering the Third Millennium - Cameron (2000) (Correct)
Similar documents based on text: More All
0.4: A .699-Approximation Algorithm for Max-Bisection - Ye (1999) (Correct)
0.3: A New Way of Using Semidefinite Programming with.. - Andersson.. (2001) (Correct)
0.3: A New Way to Use Semidefinite Programming with.. - Andersson.. (2001) (Correct)
Related documents from co-citation: More All
72: Improved approximation algorithms for maximum cut and satisfiability problems us.. - GOEMANS, WILLIAMSON - 1995
33: Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
31: Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995
BibTeX entry: (Update)
A. Frieze and M. Jerrum. Improved approximation algorithms for MAX-k-CUT and MAX BISECTION. Algorithmica, 1996. (to appear). Preliminary version in Proc. of the Sixth IPCO Conference, Springer-Verlag LNCS 920, pages 1--13. http://citeseer.ist.psu.edu/frieze94improved.html More
@incollection{ frieze95improved,
author = "A. {FRIEZE} and M. {JERRUM}",
title = "Improved approximation algorithms for {MAX} k-{CUT} and {MAX} {BISECTION}",
booktitle = "Integer Programming and Combinatorial Optimization",
volume = "920",
publisher = "Springer",
editor = "Egon Balas and Jens Clausen",
pages = "1--13",
year = "1995",
url = "citeseer.ist.psu.edu/frieze94improved.html" }
Citations (may not include all citations):230 Interior point methods in Semi-Definite Programming with app.. - Alizadeh
146 Order Statistics (context) - David - 1980
106 Approximation algorithms for MAX-CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
72 The Asymptotic Theory of Extreme Order Statistics (context) - Galambos - 1978
61 Oxford University Press (context) - Titchmarsh, of et al. - 1939
16 linear programming and branch and bound (context) - Wolsey, analysis - 1980
7 London Mathematical Society Lecture Notes (context) - Welsh, Knots et al. - 1993
2 translated from the Italian by (context) - Sansone, Functions - 1959
2 The correlation of maxima in samples drawn from a bivariate .. (context) - Bofinger, Bofinger - 1965
2 Notes on generating functions of polynomials: Hermite polyno.. (context) - Watson - 1933
1 Improved graph coloring by semidefinite programming (context) - Karger, Motwani et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://karush.rutgers.edu/~alizadeh/Sdppage/papers.html): More
Approximating the Value of Two Prover Proof Systems, With.. - Feige, Goemans (1995) (Correct)
Approximate Graph Coloring by Semidefinite Programming - Karger, Motwani, Sudan (1994) (Correct)
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (Correct)
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