Advertisement

Approximating Alternative Solutions

  • Michael Krüger
  • Harald Hempel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)

Abstract

We study the approximability of alternative solutions for NP-problems. In particular, we show that approximating the second best solution is in many cases, such as MaxCut, MaxSat, Minimum Steiner Tree, and others, substantially easier than approximating a first solution. We prove that our polynomial-time approximation scheme for the second best solution of Minimum Steiner Tree is optimal. In contrast we also argue that for the problems Minimum Independent Dominating Set and Minimum Traveling Salesperson Problem a given optimal solution does not simplify finding a second best solution.

Keywords

Feasible Solution Alternative Solution Steiner Tree Hamiltonian Cycle Satisfying Assignment 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Berlin (1999)zbMATHGoogle Scholar
  2. 2.
    Abdelbar, A.M., Hedetniemi, S.M.: Approximating MAPs for Belief Networks is NP-hard and other Theorems. Artificial Intelligence 102(1), 21–38 (1998)CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    Bern, M., Plassmann, P.: The Steiner Problem with Edge Lengths 1 and 2. Inform. Process. Lett. 32(4), 171–176 (1989)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    Bazgan, C., Santha, M., Tuza, Z.: On the Approximation of Finding another Hamiltonian Cycle in Cubic Hamiltonian Graphs. Journal of Algorithms 31(1), 249–268 (1999)CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    de Bondt, M.: On the ASP-Completeness of Cryptarisms. Technical Report 0419, Department of Mathematics, Radboud University of Nijmegen (2004)Google Scholar
  6. 6.
    Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. Assoc. Comput. Mach. 42(6), 1115–1145 (1995)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Halldórsson, M.M.: Approximating the Minimum Maximal Independence Number. Inform. Process. Lett. 46(4), 169–172 (1993)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Kann, V.: Polynomially Bounded Minimization Problems that are Hard to Approximate. Nordic J. Comput. 1(3), 317–331 (1994); Selected papers of the 20th International Colloquium on Automata, Languages and Programming (ICALP 1993), Lund (1993)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Krüger, M.: Weitere Hamiltonkreise in Graphen und Inverse Hamiltonkreisprobleme (German). Master’s thesis, Friedrich-Schiller-University Jena, Germany (2005)Google Scholar
  10. 10.
    Krüger, M.: On the Complexity of Alternative Solutions. PhD Thesis, Friedrich-Schiller-University Jena, Germany (2008)Google Scholar
  11. 11.
    McPhail, B.P.: The Complexity of Puzzles: NP-Completeness Results for Nurikabe and Minesweeper. Bachelor thesis, The Division of Mathematics and Natural Sciences, Reed College, Portland (2003)Google Scholar
  12. 12.
    Orponen, P., Manila, H.: On Approximation Preserving Reductions: Complete Problems and Robust Measures (1990)Google Scholar
  13. 13.
    Papadimitriou, C.H., Steiglitz, K.: Some Complexity Results for the Traveling Salesman Problem. In: Proc. of Eighth Annual ACM Symposium on Theory of Computing, Hershey, Pennsylvania,US, pp. 1–9. Assoc. Comput. Mach., New York (1976)CrossRefGoogle Scholar
  14. 14.
    Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall Inc., Englewood Cliffs (1982)zbMATHGoogle Scholar
  15. 15.
    Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. J. Comput. System Sci. 43(3), 425–440 (1991)CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
    Papadimitriou, C.H., Yannakakis, M.: The Traveling Salesman Problem with Distances One and Two. Math. Oper. Res. 18(1), 1–11 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proc. of SODA 2000, pp. 770–779 (2000)Google Scholar
  18. 18.
    Seta, T.: The Complexity of Puzzles, Cross Sum and Their Another Solution Problems (ASP). Senior Thesis, Department of Infomation Science, the Faculty of Science, the University of Tokyo (2002)Google Scholar
  19. 19.
    Ueda, N., Nagao, T.: NP-Completeness Results for Nonogram via Parsimonious Reductions. Technical report, Tokyo Institute of Technology (1996)Google Scholar
  20. 20.
    Yannakakis, M., Gavril, F.: Edge Dominating Sets in Graphs. SIAM J. Appl. Math. 38(3), 364–372 (1980)CrossRefMathSciNetzbMATHGoogle Scholar
  21. 21.
    Yato, T., Seta, T.: Complexity and Completeness of Finding Another Solution and its Application to Puzzles. In: Proceedings of the National Meeting of the Information Processing Society of Japan (IPSJ) (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Michael Krüger
    • 1
  • Harald Hempel
    • 1
  1. 1.Institut für InformatikFriedrich-Schiller-Universität JenaJenaGermany

Personalised recommendations