Structure in approximation classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 959, Issue , 1995, Pages 539-548

  Crescenzi, P ^a   Kann, V ^b   Silvestri, R ^a   Trevisan, L ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957538193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030875     Document Type: Conference Paper

References (27)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), "Proof verification and hardness of approximation problems", Proc. of 33rd Ann. IEEE Syrup. on Foundations of Comput. Sci., IEEE Computer Society, 14-23.
2. Berman, P., and Schnitger, G. (1992), "On the complexity of approximating the independent set problem", Inform. and Comput. 96, 77-94.
3. Bovet, D.P., and Crescenzi, P. (1993), Introduction to the theory of complexity. Prentice Hall.
4. Chang, R. (1994), "On the query complexity of clique size and maximum satisfiability", Proc. 9th Ann. Structure in Complexity Theory Conf., IEEE Computer Society, 31-42 (an extended version is available as Technical Report TR-CS-95-01, Department of Computer Science, University of Maryland Baltimore County, April 1995).
5. Chang, R. (1994), "A machine model for NP-approximation problems and the revenge of the Boolean hierarchy", EATCS Bulletin 54, 166-182.
6. Chang, R., Gasarch, W.I., and Lund, C. (1994), "On bounded queries and approximation", Technical Report TR CS-94-05, Department of Computer Science, University of Maryland Baltimore County.
7. Crescenzi, P., and Panconesi, A. (1991), "Completeness in approximation classes", Inform. and Comput. 93, 241-262.
8. Crescenzi, P., and Trevisan, L. (1994), "On approximation scheme preserving reducibility and its applications", Proc. 14th FSTTCS, Lecture Notes in Comput. Sci. 880, Springer-Verlag, 330-341.
9. Fürer, M., and Raghavachari, B. (1992), "Approximating the minimum degree spanning tree to within one from the optimal degree", Proc. Third Ann. ACMSIAM Symp. on Discrete Algorithms, ACM-SIAM, 317-324.
10. Holyer, I. (1981), "The NP-completeness of edge-coloring", SIAM J. Computing 10, 718-720.
11. Johnson, D.S. (1974), "Approximation algorithms for combinatorial problems", J. Comput. System Sci. 9, 256-278.
12. Kann, V. (1992), On the approximability of NP-complete optimization problems, PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm.
13. Kann, V. (1994), "Polynomially bounded minimization problems that are hard to approximate", Nordic J. Computing 1, 317-331.
14. Kann, V. (1995), "Strong lower bounds of the approximability of some NPO PBcomplete maximization problems", Proc. MFCS, to appear.
15. Karmarkar, N., and Karp, R. M. (1982), "An efficient approximation scheme for the one-dimensional bin packing problem", Proc. of 23rd Ann. IEEE Syrup. on Foundations of Comput. Sci., IEEE Computer Society, 312-320.
16. Khanna, S., Motwani, R., Sudan, M., and Vazirani, U. (1994), "On syntactic versus computational views of approximability", Proc. of 35th Ann. IEEE Syrup. on Foundations of Comput. Sci., IEEE Computer Society, 819-830.
17. Kolaitis, P. G., and Thakur, M. N. (1991), "Approximation properties of NP minimization classes", Proc. Sixth Ann. Structure in Complexity Theory Conf., IEEE Computer Society, 353-366.
18. Krentel, M.W. (1988), "The complexity of optimization problems", J. Comput. System Sci. 36, 490-509.
19. Ladner, R.E. (1975), "On the structure of polynomial-time reducibility", J. ACM 22, 155-171.
20. Lund, C., and Yannakakis, M. (1994), "On the hardness of approximating minimization problems", J. ACM 41, 960-981.
21. Lund, C., and Yannakakis, M. (1993), "The approximation of maximum subgraph problems", Proc. of 20th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 700, Springer-Verlag, 40-51.
22. Motwani, R. (1992), "Lecture notes on approximation algorithms", Technical Report STAN-CS-92-1435, Department of Computer Science, Stanford University, 1992.
23. Orponen, P., and Mannila, H. (1987), "On approximation preserving reductions: Complete problems and robust measures", Technical Report C-1987-28, Department of Computer Science, University of Helsinki.
24. Panconesi, A., and Ranjan, D. (1993), "Quantifiers and approximation", Theoretical Computer Science 107, 145-163.
25. Papadimitriou, C. H., and Yannakakis, M. (1991), "Optimization, approximation, and complexity classes", J. Comput. System Sci. 43, 425-440.
26. Schöning, U. (1986), "Graph isomorphism is in the low hierarchy", Proc. 4th Ann. Syrup. on Theoretical Aspects of Comput. Sci., Lecture Notes in Comput. Sci. 247, Springer-Verlag, 114-124.
27. Wagner, K. (1988), "Bounded query computations", Proc. 3rd Ann. Structure in Complexity Theory Conf., IEEE Computer Society, 260-277.