SpringerLink
Log in

On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

It is shown that no polynomial-time approximation scheme exists for the reoptimization of the set covering problem in inserting an element into or eliminating it from any set. A similar result is obtained for the minimum graph coloring problem in inserting a vertex with at most two incidence edges and for the minimal bin packing problem in eliminating any element.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Ausiello, B. Escoffier, J. Monnot, and V. Th. Paschos, “Reoptimization of minimum and maximum traveling salesman’s tours,” in: Algorithmic Theory, SWAT 2006, Lect. Notes Comput. Sci., Vol. 4059, Springer, Berlin (2006), pp. 196–207.

    Google Scholar 

  2. H. J. Bockenhauer, L. Forlizzi, J. Hromkovic, et al., “On the approximability of TSP on local modifications of optimal solved instances,” Algorithmic Oper. Res., 2(2), 83–93 (2007).

    MathSciNet  Google Scholar 

  3. H. J. Bockenhauer, J. Hromkovic, T. Momke, and P. Widmayer, “On the hardness of reoptimization,” in: Proc. 34th Intern. Conf. on Current Trends in Theory and Practice of Computer Science (SOF–SEM 2008), Lect. Notes Comput. Sci., Vol. 4910, Springer, Berlin (2008), pp. 50–65.

    Google Scholar 

  4. B. Escoffier, M. Milanic, and V. Th. Paschos, “Simple and fast reoptimizations for the Steiner tree problem,” Algorithmic Oper. Res., 4(2), 86–94 (2009).

    MathSciNet  Google Scholar 

  5. C. Archetti, L. Bertazzi, and M. G. Speranza, “Reoptimizing the travelling salesman problem,” Networks, 42(3), 154–159 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  6. C. Archetti, L. Bertazzi, and M. G. Speranza, Reoptimizing the 0–1 Knapsack Problem, Manuscript (2008).

  7. G. Ausiello, V. Bonifaci, and B. Escoffier, “Complexity and approximation in reoptimization,” in: Computability in Context: Computation and Logic in the Real World, Computability in Europe (CiE) Conference 2007 (June 2007), Imperial College Press (2010), pp. 24–33.

  8. V. A. Chvatal, “A greedy heuristic for the set covering problem,” Math. Oper. Res., 4, No. 3, 233–235 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  9. U. Feige, “A threshold of lnn for approximating set cover,” J. ACM., 45, No. 4, 634–652 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  10. T. Berg and H. Hempel, “Reoptimization of TSP and Steiner tree: Changing single edge-weights,” Lect. Notes Comput. Sci., Vol. 5457, 141–151 (2009).

  11. A. Paz and S. Moran, “Non deterministic polynomial optimization problems and their approximations,” Theoret. Comput. Sci., 15, 251–277 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  12. J. K. Lenstra and A. H. G. Renooy Kan, “Complexity of scheduling under precedence constraints,” Oper. Res., 26, 22–35 (1978).

    Article  MATH  Google Scholar 

  13. M. Gary and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness [Russian translation], Mir, Moscow (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    V. A. Mikhailyuk

Authors
  1. V. A. Mikhailyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Mikhailyuk.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 42–50, May–June 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mikhailyuk, V.A. On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems. Cybern Syst Anal 47, 368–374 (2011). https://doi.org/10.1007/s10559-011-9319-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-011-9319-1

Keywords

Search

Navigation