Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh Vazirani  Home/Search
Context Related
| stanford.edu/people/raje...syntax.ps.gz mit.edu/~madhu/papers/kmsv.ps stanford.edu/~rajeev/pos...syntax.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: stanford.edu/people/raje...papers (more) From: mit.edu/~madhu/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is well-understood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes. We compare the syntactically defined class... (Update)
Cited by: More
Improving Robustness of PGP Keyrings - Conflict Detection Qinglin (Correct)
Maximum Satisfiability: How good are tabu search and.. - Mastrolilli, Gambardella (2004) (Correct)
Combinatorial Approximation Algorithms for the Maximum.. - Halperin, Zwick (2001) (Correct)
Similar documents (at the sentence level):
75.3%: A Structural View Of Approximation - Khanna (1996) (Correct)
47.4%: On Syntactic versus Computational Views of Approximability - Khanna, Motwani, Sudan.. (1994) (Correct)
45.7%: On Syntactic Versus Computational Views of Approximability - Khanna, Motwani, Sudan.. (1998) (Correct)
Active bibliography (related documents): More All
0.2: Max NP-completeness Made Easy - Crescenzi, Trevisan (1997) (Correct)
0.2: On The Computational Complexity of Inferring Evolutionary Trees - Wareham (1993) (Correct)
0.1: Approximations of Weighted Independent Set and Hereditary.. - Halldórsson (2000) (Correct)
Similar documents based on text: More All
0.7: Towards a Syntactic Characterization of PTAS - Khanna, Motwani (1996) (Correct)
0.6: A Complete Classification of the Approximability of.. - Khanna, Sudan.. (1997) (Correct)
0.5: Constraint Satisfaction: The Approximability of.. - Khanna, Sudan, Trevisan (1997) (Correct)
Related documents from co-citation: More All
40: Proof verification and hardness of approximation problems - Lund, Motwani et al. - 1992
33: and Complexity Classes (context) - Papadimitriou, Yannakakis et al. - 1991
30: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
BibTeX entry: (Update)
S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On Syntactic versus Computational Views of Approximability. In Proceedings of 35th IEEE Symposium on Foundations of Computer Science, pages 819--830, 1994. http://citeseer.ist.psu.edu/article/khanna94syntactic.html More
@inproceedings{ khanna94syntactic,
author = "Sanjeev Khanna and Rajeev Motwani and Madhu Sudan and Umesh V. Vazirani",
title = "On Syntactic versus Computational Views of Approximability",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "819-830",
year = "1994",
url = "citeseer.ist.psu.edu/article/khanna94syntactic.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
403 Proof Verification and Hardness of Approximation Problems - Arora, Lund et al. - 1992
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
219 and Complexity Classes (context) - Papadimitriou, Yannakakis et al. - 1991
210 Generalized First-Order Spectra and Polynomial-time Recogniz.. (context) - Fagin - 1974
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
126 Efficient probabilistically checkable proofs and Application.. - Bellare, Goldwasser et al. - 1993
106 Approximation Algorithms for MAX CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
88 The traveling salesman problem with distances one and two (context) - Papadimitriou, Yannakakis - 1993
83 On Syntactic versus Computational Views of Approximability - Khanna, Motwani et al. - 1994
70 Introduction to the Theory of Complexity (context) - Bovet, Crescenzi - 1993
51 the Approximability of NP-complete Optimization Problems (context) - Kann - 1992
41 Completeness in approximation classes (context) - Crescenzi, Panconesi - 1991
41 Approximation Properties of NP Minimization Classes (context) - Kolaitis, Thakur - 1995
35 On approximating the longest path in a graph - Karger, Motwani et al. - 1993
32 Approximate Solution of NP Optimization Problems (context) - Ausiello, Crescenzi et al. - 1995
26 Approximating Maximum Independent Set in Bounded Degree Grap.. (context) - Berman, Furer - 1993
20 On approximation scheme preserving reducibility and its appl.. - Crescenzi, Trevisan - 1994
15 Discrete Applied Mathematics (context) - Hochbaum, for et al. - 1982
15 The analysis of local search problems and their heuristics (context) - Yannakakis - 1990
14 Theoretical Computer Science (context) - Panconesi, Ranjan et al. - 1993
11 New Local Search Approximation Techniques for Maximum Genera.. (context) - Alimonti - 1994
6 Improved Approximations of Independent Sets in Bounded-Degre.. (context) - Halldorsson, Radhakrishnan - 1994
3 Approximating MAX SNP Problems via Semi-Definite Programming (context) - Khanna, Motwani et al. - 1996
2 and Approximability of NP Optimization Problems (context) - Ausiello, Protasi et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/people/rajeev/papers.html): More
Approximation Algorithms for the Largest Common Subtree Problem - Sanjeev Khanna (1995) (Correct)
Lecture Notes on Approximation Algorithms - Volume I - Motwani (1992) (Correct)
Approximation Techniques for Average Completion Time.. - Chekuri, Motwani.. (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