Robert Krauthgamer  Home/Search
Context
Related
| cs.huji.ac.il/~rob...PhDThesis01.ps.gz 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: cs.huji.ac.il/~robi/pape...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: (Update)
Similar documents (at the sentence level):
21.6%: A Polylogarithmic Approximation of the Minimum Bisection - Feige, Krauthgamer (2001) (Correct)
9.8%: Finding and Certifying a Large Hidden Clique in a Semi-Random .. - Feige, Krauthgamer (1999) (Correct)
7.7%: A Polylogarithmic Approximation of the Minimum Bisection.. - Feige, al. (2001) (Correct)
Active bibliography (related documents): More All
0.4: Proving Integrality Gaps Without Knowing the Linear Program - Arora, Bollobás, Lovász (2002) (Correct)
0.4: Spectral Techniques Applied to Sparse Random Graphs - Feige, Ofek (2003) (Correct)
0.4: Spectral Partitioning of Random Graphs - McSherry (2001) (Correct)
Similar documents based on text: More All
0.3: On Cutting a Few Vertices From a Graph - Feige, Krauthgamer, Nissim (2001) (Correct)
0.3: Approximation Algorithms for Maximization Problems arising in.. - Langberg (1999) (Correct)
0.3: Approximating the Minimum Bisection Size (extended Abstract) - Feige, Krauthgamer, Nissim (2000) (Correct)
BibTeX entry: (Update)
@misc{ krauthgamer-coping,
author = "Robert Krauthgamer",
title = "Coping with NP-hardness: Approximating minimum bisection and heuristics
for maximum clique",
url = "citeseer.ist.psu.edu/497049.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
957 The probabilistic method (context) - Alon, Spencer - 1992
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
773 Reducibility among combinatorial problems (context) - Karp - 1972
403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1998
333 Geometric algorithms and combinatorial optimization (context) - Grotschel, Lov'asz et al. - 1993
318 Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
226 for approximating set cover (context) - Feige, of - 1998
225 Some simplified NP-complete graph problems (context) - Garey, Johnson et al. - 1976
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
212 Probabilistic checking of proofs: a new characterization of .. - Arora, Safra - 1998
189 Parameterized complexity - Downey, Fellows - 1999
187 Polynomial time approximation schemes for Euclidean travelin.. - Arora - 1998
170 The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
149 Polynomial time approximation schemes for dense instances of.. - Arora, Karger et al. - 1999
120 Some optimal inapproximability results (context) - Hastad - 1997
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1997
112 Average case complete problems (context) - Levin - 1986
104 Approximating maximum independent sets by excluding subgraph.. - Boppana, Halld'orsson - 1992
98 Zero knowledge and the chromatic number - Feige, Kilian - 1998
96 Fast approximation algorithms for the knapsack and sum of su.. (context) - Ibarra, Kim - 1975
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
91 Approximation algorithms (context) - Vazirani - 2001
88 Eigenvalues and graph bisection: An average-case analysis (context) - Boppana - 1987
72 Cones of matrices and set-functions and 0-1 optimization (context) - Lov'asz, Schrijver - 1991
72 Graph bisection algorithms with good average case behavior (context) - Bui, Chaudhuri et al. - 1987
56 the Shannon capacity of a graph (context) - Lov'asz - 1979
51 Nearoptimal hardness results and approximation algorithms fo.. - Guruswami, Khanna et al. - 1999
47 Clique is hard to approximate within n 1\Gammaffl (context) - Hastad - 1999
42 How good is recursive bisection - Simon, Teng - 1997
42 approximate min-cut max-flow theorem and approximation algor.. - Aumann, Rabani et al. - 1998
38 A still better performance guarantee for approximate graph c.. (context) - Halld'orsson - 1993
37 Approximating the bandwidth via volume respecting embeddings - Feige - 2000
36 A new approach to the minimum cut problem - Karger, Stein - 1996
35 On approximating the longest path in a graph - Karger, Motwani et al. - 1997
34 The eigenvalues of random symmetric matrices (context) - Furedi, Koml'os - 1981
32 Large cliques elude the Metropolis process (context) - Jerrum - 1992
31 on and M. A. Trick, editors. Cliques, Coloring, and Satisfia.. (context) - Johns
30 The probabilistic analysis of some combinatorial search algo.. (context) - Karp - 1976
30 The sandwich theorem - Knuth - 1994
30 Multicommodity max-flow min-cut theorems and their use in de.. (context) - Leighton, Rao - 1999
29 Cut problems and their applications to divide-and-conquer - Shmoys - 1997
27 A polylogarithmic approximation of the minimum bisection - Feige, Krauthgamer - 2000
26 Finding good approximate vertex and edge partitions is NPhar.. (context) - Bui, Jones - 1992
24 Algorithmic theory of random graphs - Frieze, McDiarmid - 1997
24 and multicommodity flow (context) - Klein, Plotkin et al. - 1993
23 Randomized graph products (context) - Feige - 1997
22 Stable sets and polynomials (context) - Lov'asz - 1994
21 a representation of the matching polytope via semidefinite l.. (context) - Stephen, Tuncel - 1999
18 Fast approximate graph partitioning algorithms - Even, Naor et al. - 1997
18 Finding a large hidden clique in a random graph - Alon, Krivelevich et al. - 1998
18 Fast approximate graph partitioning algorithms - Even, Naor et al. - 1999
17 cuts within twice the optimal (context) - Saran, Vazirani - 1995
16 Coloring random and semi-random k-colorable graphs - Blum, Spencer - 1995
15 The solution of some random NP-hard problems in polynomial e.. (context) - Dyer, Frieze - 1989
15 volume 840 of Lecture Notes in Computer Science (context) - Reinelt, Salesman - 1994
13 Finding separator cuts in planar graphs within twice the opt.. - Garg, Saran et al. - 1999
12 The Metropolis algorithm for graph bisection (context) - Jerrum, Sorkin - 1998
10 the matrix-cut rank of polyhedra - Cook, Dash - 2000
9 the concentration of eigenvalues of random symmetric matrice.. - Alon, Krivelevich et al. - 2001
9 When does the positive semidefiniteness constraint help in l.. - Goemans, Tuncel - 2000
9 An improved lower bound for approximating CVP - Dinur, Kindler et al. - 1999
8 Bin packing can be solved within (context) - de la, Lueker - 1981
7 Heuristics for semirandom graph problems - Feige, Kilian - 2001
7 Algorithms for graph partitioning on the planted partition m.. - Condon, Karp - 1999
7 Approximating the independence number and the chromatic numb.. - Krivelevich, Vu - 2000
5 Hiding cliques for cryptographic security - Juels, Peinado - 2000
5 Wiley-Interscience series in discrete mathematics (context) - Lawler, Lenstra et al. - 1985
5 Approximating the minimum bisection size (context) - Feige, Krauthgamer et al. - 2000
5 Expected complexity of graph partitioning problems (context) - Kucera - 1995
4 Finding and certifying a large hidden clique in a semirandom.. - Feige, Krauthgamer - 2000
4 Cambridge-New York (context) - Horn, Johnson et al. - 1985
4 the hardness of approximating label cover - Dinur, Safra - 1999
3 The asymptotic behaviour of Lov'asz' ` function for random g.. (context) - Juh'asz - 1982
3 The probable value of the Lov'asz-Schrijver relaxations for .. (context) - Feige, Krauthgamer - 2001
1 Algorithms for coloring semi-random graphs (context) - Subramanian, Furer et al. - 1998
1 Strong inapproximability of the basic k-spanner problem (context) - Elkin, Peleg - 2000
1 colorable graphs in polynomial average time (context) - Subramanian, k- - 1999
1 Thi list is updated continuously and can be found httpwww (context) - Crescenzi, of et al. - 1995
Documents on the same site (http://www.cs.huji.ac.il/~robi/papers/papers.html): More
On Approximating the Achromatic Number - Kortsarz, Krauthgamer (2001) (Correct)
On Cutting a Few Vertices From a Graph - Feige, Krauthgamer, Nissim (2001) (Correct)
Private Approximation of NP-hard Functions (Extended.. - Halevi, Krauthgamer.. (2001) (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