Structure in approximation classes

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1759-1782

  Crescenzi, Pierluigi ^a   Kann, Viggo ^b   Silvestri, Riccardo ^c   Trevisan, Luca ^d  

^a UNIVERSITY OF FLORENCE   (Italy)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FUNCTIONS; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION CLASSES; OPTIMIZATION PROBLEMS; QUERY COMPLEXITY; REDUCIBILITY;

APPROXIMATION THEORY;

EID: 0032614459     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796304220     Document Type: Article

References (44)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 14-23.
2. J. L. BALCÁZAR, J. DÍAZ. AND J. GABARRÓ. Structural Complexity I, Springer-Verlag, Berlin, New York, 1988.
3. R. BEIGEL, Bounded queries to SAT and the Boolean hierarchy, Theoret. Comp. Sci., 84 (1991), pp. 199-223.
4. P. BERMAN, AND G. SCHNITGER, On the complexity of approximating the independent set problem, Inform, and Comput., 96 (1992), pp. 77-94.
5. D. P. BOVET AND P. CRESCENZI, Introduction to the Theory of Complexity, Prentice Hall, London, 1994.
6. L. CAI, Nondeterminism and Optimization, Ph.D. thesis, Department of Computer Science, Texas A&M University, College Station, TX, 1994.
7. R. CHANG, On the query complexity of clique size and maximum satisfiability, in Proc. 9th IEEE Structure in Complexity Theory Conf., IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 31-42.
8. R. CHANG, A machine model for NP-approximation problems and the revenge of the Boolean hierarchy, EATCS Bulletin, 54 (1994), pp. 166-182.
9. R. CHANG, W. I. GASARCH, AND C. LUND, On Bounded Queries and Approximation, Technical Report TR CS-94-05, Department of Computer Science. University of Maryland Baltimore County, Baltimore, MD, 1994.
10. S. A. COOK, The complexity of theorem proving procedures, in Proc. 3rd ACM Symp. on Theory of Computing, ACM, New York, 1971, pp. 151-158.
11. P. CRESCENZI, A short guide to approximation preserving reductions, in Proc. 12th IEEE Conference on Computational Complexity, IEEE Computer Society Press. Los Alamitos, CA, 1997, pp. 262-273.
12. P. CRESCENZI AND V. KANN, A Compendium of NP Optimization Problems, Technical Report SI/RR-95/02, Dipartimento di Scienze dell'Informaziorie, Università di Roma "La Sapienza," http://www.nada.kth.se/theory/compendium/ (1995).
13. P. CRESCENZI AND V. KANN, Approximation on the web: a compendium of NP optimization problems, in Proc. Int. Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 1269, Springer-Verlag, New York, 1997, pp. 111-118.
14. P. CRESCENZI AND A. PANCONESI, Completeness in approximation classes, Inform, and Comput., 93 (1991), pp. 241-262.
15. P. CRESCENZI AND R. SILVESTRI, Relative complexity of evaluating the optimum cont and constructing the optimum for maximization problems. Inform. Process. Lett., 33 (1990), pp. 221-226
16. P. CRESCENZI AND L. TREVISAN, On approximation scheme preserving reducibility and its applications, in Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 880, Springer-Verlag, New York, 1994, pp. 330-341.
17. M. FÜRER AND B. RAGHAVACHARI, Approximating the minimum degree spanning tree to within one from the optimal degree, in Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, SIAM, Philadelphia, 1992, pp. 317-324.
18. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide, to the Theory of NP-Completeness, Freeman, New York, 1979.
19. M. X. GOEMANS AND D. P. WILLIAMSON, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math., 7 (1994), pp. 656-666.
20. I. HOLYER, The NP-completeness of edge-coloring, SIAM J. Comput., 10 (1981), pp. 718-720.
21. R. IMPAGLIAZZO AND M. NAOR, Decision trees and downward closures, in Proc. 3rd IEEE Structure in Complexity Theory Conf., IEEE Computer Society Press, Los Alamitos, CA. 1988, pp. 29-38.
22. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
23. J. KADIN, The polynomial time hierarchy collapses if the Boolean hierarchy collapses, SIAM J. Comput., 17 (1988), pp. 1263-1282.
24. J. KADIN, Erratum: The polynomial time hierarchy collapses if the Boolean hierarchy collapse, SIAM J. Comput., 20 (1991), p. 404.
25. V. KANN, On the Approximability of NP-Complete Optimization Problem, Ph.D. thesis, Department of Numerical Analysis and Computing Science. Royal Institute of Technology, Stockholm, 1992.
26. V. KANN, Polynomially bounded minimization problems that are hard to approximate, Nordic J. Comput., 1 (1994), pp. 317-331.
27. N. KARMARKAR AND R. M. KARP, An efficient approximation scheme for the one-dimensional bin packing problem, in Proc. 23rd IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1982, pp. 312-320.
28. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI, On syntactic versus computational views of approximability, in Proc. 35th IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 819-830.
29. P. G. KOLAITIS AND M. N. THAKUR, Approximation properties of NP minimization classes, in Proc. 6th IEEE Structure in Complexity Theory Conf., IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 353-366.
30. M. W. KRENTEL, The complexity of optimization problems, J. Comput. System Sci., 36 (1988), pp. 490-509.
31. R. E. LADNER, On the structure of polynomial-time reducibility, J. ACM, 22 (1975), pp. 155-171.
32. T. J. LONG, On γ-reducibility versus polynomial time many-one reducibility, Theoret. Comput. Sci., 14 (1981), pp. 91-101.
33. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1993), pp. 960-981.
34. R. MOTWANI, Lecture Notes on Approximation Algorithms, Technical Report STAN-CS-92-1435, Department of Computer Science, Stanford University, Stanford, CA, 1992.
35. P. ORPONEN AND H. MANNILA, On Approximation Preserving Reductions: Complete Problems and Robust Measures, Technical Report C-1987-28, Department of Computer Science. University of Helsinki, Helsinki, Finland, 1987.
36. A. PANCONESI AND D. RANJAN, Quantifiers and approximation. Theoret. Comput. Sci., 107 (1993), pp. 145-163.
37. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
38. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
39. M. QUEYRANNE, Bounds for assembly line balancing heuristics, Oper. Res., 33 (1985), pp. 1353-1359.
40. U. SCHÖNING, Graph isomorphism is in the low hierarchy, in Proc. 4th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 247, Springer-Verlag, New York, 1986, pp. 114-124.
41. H. U. SIMON, Continuous reductions among combinatorial optimization problems, Acta Inform., 26 (1989), pp. 771-785.
42. K. WAGNER, Bounded query computations, in Proc. 3rd IEEE Structure in Complexity Theory Conf., IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 260-277.
43. T. S. WEE AND M. J. MAGAZINE. Assembly line balancing as generalized bin packing, Oper. Res. Lett., 1 (1982), pp. 56-58.
44. M. YANNAKAKIS, On the approximation of maximum satisfiability, J. Algorithms, 17 (1994), pp. 475-502.