Sanjeev Khanna University of Pennsylvania Nathan Linial Hebrew University...  Home/Search
Context Related
| cs.huji.ac.il/~nat...rox_chi_hard.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/~nati/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the hardness of approximating the chromatic number when the input graph is k-colorable for some xed k 3. Our main result is that it is NP-hard to nd a 4-coloring of a 3-chromatic graph. As an immediate corollary we obtain that it is NP-hard to color a k-chromatic graph with at most k + 2bk=3c 1 colors. We also give simple proofs of two results of Lund and Yannakakis [20]. The rst result shows that it is NP-hard to approximate the chromatic number to within n for some xed... (Update)
Cited by: More
On approximate graph colouring and MAX-k-CUT.. - de Klerk, Pasechnik.. (2000) (Correct)
Priority Algorithms for Graph Optimization Problems - Borodin, Boyar, Larsen (Correct)
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
Similar documents (at the sentence level):
16.4%: A Structural View Of Approximation - Khanna (1996) (Correct)
Active bibliography (related documents): More All
0.2: Approximating Maximum Independent Sets by Excluding.. - Boppana, Halldórsson (1992) (Correct)
0.1: Learning Binary Relations and Total Orders - Goldman, Rivest, Schapire (1989) (Correct)
0.1: Cryptographic Limitations on Learning Boolean Formulae and.. - Kearns, Valiant (1989) (Correct)
Similar documents based on text: More All
0.2: Near-Optimal Hardness Results and Approximation.. - Guruswami.. (1999) (Correct)
0.2: Relating Word and Tree Automata - Kupferman, Safra, Vardi (1996) (Correct)
0.2: Probabilistic Checking of Proofs: A New Characterization of NP - Arora, Safra (1992) (Correct)
Related documents from co-citation: More All
44: the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
30: Probabilistic checking of proofs: A new characterization of NP - Arora, Safra - 1992
28: Approximating maximum independent sets by excluding subgraphs - Boppana, Halld'orsson - 1992
BibTeX entry: (Update)
S. Khanna, N. Linial and S. Safra. On the Hardness of Approximating the Chromatic Number. In Proc. 2nd Israel Symp. on Theory of Computing and Systems (ISTCS93), IEEE Computer Society Press, pages 250--260, 1993. http://citeseer.ist.psu.edu/618563.html More
@inproceedings{ khanna93hardness,
author = "Sanjeev Khanna and Nathan Linial and Shmuel Safra",
title = "On the Hardness of Approximating the Chromatic Number",
booktitle = "Israel Symposium on Theory of Computing Systems",
pages = "250-260",
year = "1993",
url = "citeseer.ist.psu.edu/618563.html" }
Citations (may not include all citations):212 Probabilistic checking of proofs: A new characterization of .. - Arora, Safra - 1998
61 Proof veri cation and hardness of approximation problems - Arora, Lund et al. - 1998
23 New approximation algorithms for graph coloring - Blum
20 Algorithms for Approximate Graph Coloring - Blum - 1991
16 Some Tools for Approximate 3-Coloring (context) - Blum - 1990
6 approximation algorithm for 3-coloring (context) - Blum - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.huji.ac.il/~nati/): More
Global Self Organization of All Known Protein.. - Linial, Linial.. (1997) (Correct)
The Geometry of Graphs and Some of Its Algorithmic.. - Linial, London, Rabinovich (1994) (Correct)
Random Lifts of Graphs II: Edge Expansion - Amit, Linial (2000) (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