A structural overview of NP optimization problems

  • Danilo Bruschi
  • Deborah Joseph
  • Paul Young
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)


Polynomial Time Conjunctive Normal Form Polynomial Time Approximation Scheme Full Polynomial Time Approximation Scheme Travel Salesperson Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. Bibliography

  1. [ADP 80]
    G. Ausiello, A. D'Atri and M. Protasi, “Structure preserving reductions among convex optimization problems,” J Comput and System Sci, 21 (1980), 136–153; (first appeared in Proc 4th ICALP, Lecture Notes in Computer Science, 52 (1977), 45–60.)CrossRefGoogle Scholar
  2. [BeHa 77]
    L. Berman and J. Hartmanis, “On isomorphism and density of NP and other complete sets,” SIAM J Comput, 1 (1977), 305–322.CrossRefGoogle Scholar
  3. [BBJSY 89]
    A. Bertoni, D. Bruschi, D. Joseph, M. Sitharam and P. Young, “Generalized Boolean hierarchies and Boolean hierarchies over RP,” Univ Wisconsin CS Dept Tech Report, #809, 1–40; (short abstract to appear in FCT '89 Proceedings.)Google Scholar
  4. [CGHHSWW 89]
    J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung, “The Boolean hierarchy II: applications,” SIAM J Comput, 7 (1989), 95–111.CrossRefGoogle Scholar
  5. [CrPa 88]
    P. Crescenzi and A. Panconesi, “Completeness in approximation classes,” to appear in FCT '89 Proceedings, (1989), 16 pages.Google Scholar
  6. [Fa 74]
    R. Fagin, “Generalized first-order spectra, and polynomial-time recognizable sets,” Complexity and Computations, R. Karp (ed.), AMS, (1974).Google Scholar
  7. [GaJo 79]
    M. Garey and D. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” Freeman, 1979.Google Scholar
  8. [GoSa 76]
    T. Gonzales and S. Sahni, “P-complete approximation problems,” J ACM, 23 (1976), 555–565.CrossRefGoogle Scholar
  9. [HoKe 82]
    B. Hodgson and C. Kent, “An arithmetical characterization of NP,” Theor Comput Sci, 21 (1982), 255–267.CrossRefGoogle Scholar
  10. [HoSh 86]
    D. Hochbaum and D. Shmoys, “A unified approach to approximation algorithms for bottleneck problems,” J ACM, 33 (1986), 533–550.CrossRefGoogle Scholar
  11. [IbKi 75]
    O. Ibarra and C. Kim, “Fast approximation algorithms for the knapsack and sum of subsets problems,” J ACM, 22 (1975), 463–468.CrossRefGoogle Scholar
  12. [JAMS 89]
    D. Johnson, C. Aragon, L. McGeoch, and C. Schevon, “Optimization by simulated annealing: an experimental evaluation,” Operations Research, to appear.Google Scholar
  13. [Jo 74]
    D. Johnson, “Approximation algorithms for combinatorial problems,” J Comput and System Sci, 9 (1974), 256–278.Google Scholar
  14. [JPY 88]
    D. Johnson, C. Papadimitriou and M. Yannakakis, “How easy is local search?,” J Comput and System Sci, 37 (1988), 79–100; (first appeared in Proc 26th IEEE Symp Foundations of Comput Sci, (1985), 39–42.)CrossRefGoogle Scholar
  15. [JoYo 85]
    D. Joseph and P. Young, “Some remarks on witness functions for polynomial reducibilities in NP,” Theor Comput Sci, 39 (1985), 225–237.CrossRefGoogle Scholar
  16. [KaKa 82]
    N. Karmakar and R. Karp, “An efficient approximation scheme for the one-dimensional bin-packing problem,” IEEE 23rd Symp Foundations of Comput Sci, (1982), 312–320.Google Scholar
  17. [KGV 83]
    S. Kirkpatrick, C. Gelat, and M. Vecchi, “Optimization by simulated annealing,” Science, 220 (1983), 671–680.Google Scholar
  18. [Kr 88]
    M. Krentel, “The complexity of optimization problem,” J Comput and System Sci, 36 (1988), 490–509; (first appeared in Proc 18th ACM Symp Theory on Comput, (1986), 69–76.)CrossRefGoogle Scholar
  19. [Kr 89]
    M. Krentel, “On finding locally optimal solutions,” Proc Structure in Complexity Conference, (1989), 132–137.Google Scholar
  20. [LeMo 81]
    E. Leggett and J. Moore, “Optimization problems and the polynomial time hierarchy,” Theor Comput Sci, 15 (1981), 279–289.CrossRefGoogle Scholar
  21. [LyLi 78]
    N. Lynch and R. Lipton “On structure preserving reductions,” Siam J Comput, 7 (1978), 119–126.CrossRefGoogle Scholar
  22. [OrMa 87]
    P. Orponen and H. Mannila, “On approximation preserving reductions: complete problems and robust measures,” Tech Report, University of Helsinki, 1987.Google Scholar
  23. [Ni 75]
    R. Nigmatullin, “Complexity of the approximate solution of combinatorial problems”, Dokl Akad Nauk, SSSR 224, (1975) 289–292 (in Russian), English translation in Soviet Math Dokl, 16, 1199–1203.Google Scholar
  24. [Pa 84]
    C. Papadimitriou, “On the complexity of unique solutions”, J ACM, 31 (1984), 392–400.CrossRefGoogle Scholar
  25. [PaMo 81]
    A. Paz and S. Moran, “Non deterministic polynomial optimization problems and their approximation,” Theor Comput Sci, 15 (1981), 251–277; (first appeared in Proc 4th ICALP, Lecture Notes in Computer Science, 52 (1977), 45–60.)CrossRefGoogle Scholar
  26. [PaWo 85]
    C. Papadimitriou and D. Wolfe, “The complexity of facets resolved,” J Comput and System Sci, 37 (1988), 2–13; (first appeared in Proc IEEE 26th Symp on Foundations of Comput Sci, (1985), 74–78).CrossRefGoogle Scholar
  27. [PaYa 84]
    C. Papadimitriou and M. Yannakakis, “The complexity of facets (and some facets of complexity),” J Computer and System Sciences, 28 (1984), 244–259, (first appeared in Proc 14th ACM Symp Theory of Comput, (1982), 255–260.)CrossRefGoogle Scholar
  28. [PaYa 88]
    C. Papadimitriou and M. Yannakakis, “Optimization, approximation, and complexity classes,” Proc 20th ACM Symp Theory Comput, (1988), 229–234.Google Scholar
  29. [Sa 76]
    S. Sahni, “Algorithms for scheduling independent tasks,” J ACM, 23 (1976), 116–127.CrossRefGoogle Scholar
  30. [Wa 86]
    K. Wagner, “More complicated questions about maxima and minima, and some closure properties of NP,” Theor Comput Sci, 51 (1987), 53–80; (first appeared in Proc 13th ICALP, Lecture Notes Computer Science, 226 (1986), 434–443.)CrossRefGoogle Scholar
  31. [Wa 88]
    K. Wagner, “Bounded query computations,” Proc Structure in Complexity Conference, (1988), 260–277.Google Scholar
  32. [WaWe 85]
    K. Wagner and G. Wechsung, “Computational complexity,” D. Reidel Publishing, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Danilo Bruschi
    • 1
    • 2
  • Deborah Joseph
    • 2
  • Paul Young
    • 2
    • 3
  1. 1.Università degli Studi di MilanoItaly
  2. 2.University of WisconsinUSA
  3. 3.University of WashingtonUSA

Personalised recommendations