Avrim Blum. Some tools for approximate 3-coloring. Journal of the Association for Computing Machinery, 41(3):470--516, 1994. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Average Case Analysis of Fully Dynamic.. - Alimonti.. (Correct)
Approximating Maximum Independent Sets by Excluding.. - Boppana, Halldórsson (1992) (99 citations) (Correct)
Probabilistically Checkable Proofs and their.. - Hougardy, Prömel, Steger (1995) (6 citations) (Correct)
A Spectral Technique for Coloring Random 3-Colorable Graphs - Alon, Kahale (1997) (31 citations) (Correct)
A Structural View Of Approximation - Khanna (1996) (Correct)
Efficient Learning of Typical Finite Automata from .. - Freund, Kearns.. (1993) (20 citations) (Correct)
A Spectral Technique for Coloring Random 3-Colorable Graphs - Alon, Kahale (1994) (31 citations) (Correct)
On Approximating the Longest Path in a Graph - Karger, Motwani, Ramkumar (1993) (27 citations) (Correct)
On Approximating the Longest Path in a Graph - Karger, Motwani, Ramkumar (1993) (27 citations) (Correct)
Efficient Learning of Typical Finite Automata from.. - Freund, Kearns, Ron, .. (1993) (20 citations) (Correct)
Efficient Learning of Typical Finite Automata from .. - Freund, Kearns.. (1996) (20 citations) (Correct)
On the Hardness of Approximating the Chromatic Number - Sanjeev Khanna University (1993) (57 citations) (Correct)
Ramsey Theory Applications - Rosta (2004) (Correct)
Efficient Approximation Algorithms for Some Semidefinite Programs - Lu (1996) (Correct)
Coloring Random and Semi-Random k-Colorable Graphs - Blum, Spencer (1995) (16 citations) Self-citation (Blum) (Correct)
New Approximation Algorithms for Graph Coloring - Blum (1994) (21 citations) Self-citation (Blum) (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