Luca Trevisan  Home/Search
Context Related
| berkeley.edu/~luca/pubs/stoc01.ps 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: berkeley.edu/~luca/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove some non-approximability results for restrictions of basic combinatorial optimization problems to instances of bounded \degree" or bounded \width." Speci cally: We prove that the Max 3SAT problem on instances where each variable occurs in at most B clauses, is hard to approximate to within a factor 7=8+O(1= B), unless RP = NP . Hastad [18] proved that the problem is approximable to within a factor 7=8+1=64B in polynomial time, and that is hard to approximate to within a factor ... (Update)
Cited by: More
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
The Demand Matching Problem - Shepherd, Vetta (2002) (Correct)
Hardness of the Undirected Edge-Disjoint Paths Problem - Andrews, Zhang (2005) (Correct)
Active bibliography (related documents): More All
0.5: On the Hardness of Approximating k-Dimensional Matching - Hazan Safra And (Correct)
0.5: Approximations of Weighted Independent Set and Hereditary.. - Halldórsson (2000) (Correct)
0.3: Inapproximability Results for Set Splitting and Satisfiability.. - Guruswami (2000) (Correct)
Similar documents based on text: More All
0.4: Improved Non-approximability Results for Vertex Cover with.. - Clementi, Trevisan (1996) (Correct)
0.4: Improved Non-approximability Results for Minimum Vertex.. - Clementi, Trevisan (1996) (Correct)
0.3: On Approximation Algorithms for Hierarchical MAX-SAT - Agarwal, Condon (1997) (Correct)
Related documents from co-citation: More All
8: for approximating set cover (context) - Feige, of - 1996
6: Probabilistic checking of proofs: A new characterization of NP - Arora, Safra - 1992
6: Improved approximation algorithms for the vertex cover problem in graphs and hyp.. - Halperin - 1999
BibTeX entry: (Update)
L. Trevisan. Non-approximability Results for Optimization Problems on Bounded-Degree Instances. In 33rd STOC, pages 453--461, 2001. 7 http://citeseer.ist.psu.edu/trevisan01nonapproximability.html More
@inproceedings{ trevisan01nonapproximability,
author = "Luca Trevisan",
title = "Non-approximability results for optimization problems on bounded degree instances",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "453-461",
year = "2001",
url = "citeseer.ist.psu.edu/trevisan01nonapproximability.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures (context) - Leighton - 1992
957 The Probabilistic Method (context) - Alon, Spencer - 1992
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
226 for approximating set cover (context) - Feige, of - 1998
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
139 A greedy heuristic for the set-covering problem (context) - Chvatal - 1979
118 A parallel repetition theorem - Raz - 1998
108 Hardness of approximations - Arora, Lund - 1996
94 Interactive proofs and the hardness of approximating cliques - Feige, Goldwasser et al. - 1996
75 Approximation algorithms for set covering and vertex cover p.. (context) - Hochbaum - 1982
74 the ratio of optimal integral and fractional covers (context) - Lovasz - 1975
69 Some optimal inapproximability results (context) - astad - 1997
44 PCP's and non-approximability { towards tight results (context) - Bellare, Goldreich et al. - 1998
43 Probabilistic Proofs and Pseudorandomness (context) - Goldreich - 1999
42 Probabilistic Checking of Proofs and Hardness of Approximati.. (context) - Arora - 1994
33 Derandomized graph products - Alon, Feige et al. - 1995
26 A PCP characterization of NP with optimal amortized query co.. - Samorodnitsky, Trevisan - 2000
23 Approximating the independence number via the function (context) - Alon, Kahale - 1998
20 A tight characterization of NP with 3 query PCPs - Guruswami, Lewin et al. - 1998
15 Ecient probabilistically checkable proofs and applications t.. (context) - Bellare, Goldwasser et al. - 1993
14 and new constant-degree expanders and extractors (context) - Reingold, Vadhan et al. - 2000
12 Electronic Colloquium on Computational Complexity (context) - Berman, Karpinski et al. - 1998
11 Probabilistically checkable proofs with low amortized query .. - Sudan, Trevisan - 1998
9 Improved non-approximability results for vertex cover with d.. - Clementi, Trevisan - 1999
4 Query-ecient checking of proofs and improved PCP characteriz.. (context) - Guruswami - 1999
2 A survey on independent set approximations (context) - Halldorsson - 1998
2 Personal communication to M (context) - Vishwanathan - 1996
1 Approximate graph coloring by semi-de nite programming (context) - Karger, Motwani et al. - 1998
1 On bounded occurrence constraint satisfaction (context) - astad - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.berkeley.edu/~luca/papers.html): More
Recycling Queries in PCPs and in Linearity Tests (Extended.. - Trevisan (1998) (Correct)
Probabilistically Checkable Proofs with Low Amortized Query.. - Sudan, Trevisan (1998) (Correct)
On the Efficiency of Polynomial Time Approximation Schemes - Cesati, Trevisan (1997) (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