Skip to main content
SpringerLink
Log in

Structure in approximation classes

Extended abstract

  • Session 10A: Complexity Theory
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Included in the following conference series:

Research partially supported by the MURST project Algoritmi, Modelli di Calcolo, Strutture Informative.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 Symp. on Foundations of Comput. Sci., IEEE Computer Society, 14–23.

    Google Scholar 

  2. Berman, P., and Schnitger, G. (1992), “On the complexity of approximating the independent set problem”, Inform. and Comput. 96, 77–94.

    Article  Google Scholar 

  3. Bovet, D.P., and Crescenzi, P. (1993), Introduction to the theory of complexity. Prentice Hall.

    Google Scholar 

  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).

    Google Scholar 

  5. Chang, R. (1994), “A machine model for NP-approximation problems and the revenge of the Boolean hierarchy”, EATCS Bulletin 54, 166–182.

    Google Scholar 

  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.

    Google Scholar 

  7. Crescenzi, P., and Panconesi, A. (1991), “Completeness in approximation classes”, Inform. and Comput. 93, 241–262.

    Article  Google Scholar 

  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.

    Google Scholar 

  9. Fürer, M., and Raghavachari, B. (1992), “Approximating the minimum degree spanning tree to within one from the optimal degree”, Proc. Third Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 317–324.

    Google Scholar 

  10. Holyer, I. (1981), “The NP-completeness of edge-coloring”, SIAM J. Computing 10, 718–720.

    Article  Google Scholar 

  11. Johnson, D.S. (1974), “Approximation algorithms for combinatorial problems”, J. Comput. System Sci. 9, 256–278.

    Google Scholar 

  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.

    Google Scholar 

  13. Kann, V. (1994), “Polynomially bounded minimization problems that are hard to approximate”, Nordic J. Computing 1, 317–331.

    Google Scholar 

  14. Kann, V. (1995), “Strong lower bounds of the approximability of some NPO PB-complete maximization problems”, Proc. MFCS, to appear.

    Google Scholar 

  15. Karmarkar, N., and Karp, R. M. (1982), “An efficient approximation scheme for the one-dimensional bin packing problem”, Proc. of 23rd Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Computer Society, 312–320.

    Google Scholar 

  16. Khanna, S., Motwani, R., Sudan, M., and Vazirani, U. (1994), “On syntactic versus computational views of approximability”, Proc. of 35th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Computer Society, 819–830.

    Google Scholar 

  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.

    Google Scholar 

  18. Krentel, M.W. (1988), “The complexity of optimization problems”, J. Comput. System Sci. 36, 490–509.

    Article  Google Scholar 

  19. Ladner, R.E. (1975), “On the structure of polynomial-time reducibility”, J. ACM 22, 155–171.

    Article  Google Scholar 

  20. Lund, C., and Yannakakis, M. (1994), “On the hardness of approximating minimization problems”, J. ACM 41, 960–981.

    Article  Google Scholar 

  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.

    Google Scholar 

  22. Motwani, R. (1992), “Lecture notes on approximation algorithms”, Technical Report STAN-CS-92-1435, Department of Computer Science, Stanford University, 1992.

    Google Scholar 

  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.

    Google Scholar 

  24. Panconesi, A., and Ranjan, D. (1993), “Quantifiers and approximation”, Theoretical Computer Science 107, 145–163.

    Article  Google Scholar 

  25. Papadimitriou, C. H., and Yannakakis, M. (1991), “Optimization, approximation, and complexity classes”, J. Comput. System Sci. 43, 425–440.

    Article  Google Scholar 

  26. Schöning, U. (1986), “Graph isomorphism is in the low hierarchy”, Proc. 4th Ann. Symp. on Theoretical Aspects of Comput. Sci., Lecture Notes in Comput. Sci. 247, Springer-Verlag, 114–124.

    Google Scholar 

  27. Wagner, K. (1988), “Bounded query computations”, Proc. 3rd Ann. Structure in Complexity Theory Conf., IEEE Computer Society, 260–277.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Università degli Studi di Roma “La Sapienza”, Via Salaria 113, 00198, Rome, Italy

    P. Crescenzi, R. Silvestri & L. Trevisan

  2. Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44, Stockholm, Sweden

    V. Kann

Authors
  1. P. Crescenzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Kann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Silvestri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L. Trevisan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crescenzi, P., Kann, V., Silvestri, R., Trevisan, L. (1995). Structure in approximation classes. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030875

Download citation

  • DOI: https://doi.org/10.1007/BFb0030875

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation