Don Coppersmith, David Gamarnik, Mohammad Hajiaghayi, Gregory B. Sorkin  Home/Search
Context
Related
Links: ACM DBLP | mit.edu/%7Ehajiagha/max.pdf 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: mit.edu/~hajiagha/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: With random inputs, certain decision problems undergo a "phase transition". We prove similar behavior in an optimization context. (Update)
Similar documents (at the sentence level):
38.9%: Random Max 2-Sat And Max Cut - Coppersmith, Gamarnik, Hajiaghayi.. (2003) (Correct)
Active bibliography (related documents): More All
0.3: Random Assignment with Integer Costs - Parviainen (2001) (Correct)
0.3: Embracing the Giant Component - Abraham Flaxman David (2004) (Correct)
0.3: Avoiding a Giant Component II - Bohman, Frieze, Wormald (2002) (Correct)
Similar documents based on text: More All
0.3: MAX-SAT approximation beyond the limits of.. - Dantsin.. (1998) (Correct)
0.3: New Worst-Case Upper Bounds for MAX-2-SAT with.. - Gramm, Hirsch.. (2000) (Correct)
0.3: The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 - Hajiaghayi, Sorkin (2003) (Correct)
BibTeX entry: (Update)
@misc{ coppersmith-random,
author = "Don Coppersmith and David Gamarnik and Mohammad Hajiaghayi and Gregory
B. Sorkin",
title = "Random max sat, Random max cut, and Their Phase Transitions",
url = "citeseer.ist.psu.edu/544775.html" }
Citations (may not include all citations):415 Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
139 Ten lectures on the probabilistic method (context) - Spencer - 1994
56 and linear programming (context) - Trevisan, Sorkin et al. - 2097
51 the satisfiability and maximum satisfiability of random 3-CN.. (context) - Broder, Frieze et al. - 1993
43 Modern graph theory (context) - Bollobas - 1998
30 erential equations for random processes and random graphs (context) - Wormald - 1995
29 A threshold for unsatisfiability (context) - Goerdt - 1996
27 Some optimal inapproximability results - Hastad - 1997 ACM DBLP
25 Necessary and su#cient conditions for sharp thresholds of gr.. (context) - Friedgut - 1999
25 On random 2- SAT (context) - de la - 1992
22 approximation algorithm for MAX 3SAT (context) - Karlo, Zwick - 1997
16 Bounding the unsatisfiability threshold of random 3-SAT (context) - Janson, Stamatiou et al. - 2000 ACM DBLP
5 th Annual Symposium on Foundations of Computer Science (context) - Chvatal, Reed et al. - 1992
4 Improved rounding techniques for the MAX 2-SAT and MAX DI-CU.. - Lewin, Livnat et al. - 2002 ACM DBLP
3 Avoiding a giant component II - Bohman, Frieze et al. - 2002
3 Personal communication (context) - Janson, Sorkin - 2002
3 Random Structures and Algorithms (context) - Bohman, Frieze et al. - 2001 ACM
1 An upper bound for the maximum cut mean value (context) - Bertoni, Campadelli et al. - 1997 ACM DBLP
1 th Annual Symposium on Foundations of Computer Science (context) - some, are et al. - 1992
Documents on the same site (http://www.mit.edu/~hajiagha/pub.html): More
A goal keeper for middle size Robocup - Jamzad, Foroughnassiraei.. (2001) (Correct)
Comparing of SGML documents - Hajiaghayi (Correct)
A Note on the Consecutive Ones Submatrix Problem - Hajiaghayi, Ganjali (2002) (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