R. Boppana and M. Halldorsson. Approximating maximum independent sets by excluding subgraphs. BIT, 20:180--196, 1992. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
On the Hardness of Approximating k-Dimensional Matching - Hazan Safra And (Correct)
The Complexity of Detecting Fixed-Density Clusters - Holzapfel, Kosub, Maaß, Täubig (Correct)
The Frequency of Difficult Instances for MaxClique Approximation .. - Hitchcock (Correct)
Computational Aspects of Radiation Hybrid Mapping - Ivansson (2000) (Correct)
Towards Optimal Lower Bounds For Clique and Chromatic Number - Engebretsen, Holmerin (2 citations) (Correct)
Derandomizing Approximation Algorithms Based On Semidefinite.. - Mahajan, Ramesh (1999) (17 citations) (Correct)
Ramsey Theory Applications - Rosta (2004) (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich, Sudan (1995) (9 citations) (Correct)
Lower Bounds for On-line Graph Problems with Application.. - Bartal, Fiat, Leonardi (1996) (38 citations) (Correct)
Clique is Hard to Approximate within ... - Håstad (1998) (1 citation) (Correct)
Clique is Hard to Approximate within ... - Håstad (2002) (1 citation) (Correct)
Approximate Set Covering in Uniform Hypergraphs - Krivelevich (1 citation) (Correct)
Experimental Evaluation of the Greedy and - Random Algorithms For (Correct)
Algorithmic Support for Commodity-Based Parallel Computing.. - Leung, Phillips, al. (2003) (Correct)
Effective Techniques for the Generalized Low Power Binding.. - Davoodi, Srivastava (Correct)
Zero Knowledge and the Chromatic Number - Uriel Feige Joe (1996) (90 citations) (Correct)
Priority Algorithms for Graph Optimization Problems - Borodin, Boyar, Larsen (Correct)
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
Intractability Results for Certain Graph-Theoretic Optimization .. - Venkatesan (1997) (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) (Correct)
Computing Maximally Separated Sets in the Plane and.. - Agarwal, Overmars.. (2003) (Correct)
The Approximability of Constraint Satisfaction Problems - Khanna, Sudan, Trevisan.. (2001) (6 citations) (Correct)
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (9 citations) (Correct)
Approximating Maximum Independent Sets by Excluding.. - Boppana, Halldórsson (1992) (99 citations) Self-citation (Boppana Halld'orsson) (Correct)
First 50 documents Next 50
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