ON THE EXISTENCE OF POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE REOPTIMIZATION OF DISCRETE OPTIMIZATION PROBLEMS

被引：0
|
作者：
Mikhailyuk, V. A. [1 ]
机构：
[1] Natl Acad Sci Ukraine, VM Glushkov Inst Cybernet, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2011年 / 47卷 / 03期
关键词：
reoptimization; r-approximation algorithm; polynomial-time approximation scheme;
D O I：
10.1007/s10559-011-9319-1
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：368 / 374
页数：7
相关论文
共 50 条
  • [1] Polynomial-Time Approximation Schemes for Circle Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 713 - 724
  • [2] Polynomial-time approximation schemes for scheduling problems with time lags
    Zhang, Xiandong
    van de Velde, Steef
    [J]. JOURNAL OF SCHEDULING, 2010, 13 (05) : 553 - 559
  • [3] Polynomial-time approximation schemes for scheduling problems with time lags
    Xiandong Zhang
    Steef van de Velde
    [J]. Journal of Scheduling, 2010, 13 : 553 - 559
  • [4] Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    [J]. ALGORITHMICA, 2016, 76 (02) : 536 - 568
  • [5] Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
    Flávio K. Miyazawa
    Lehilton L. C. Pedrosa
    Rafael C. S. Schouery
    Maxim Sviridenko
    Yoshiko Wakabayashi
    [J]. Algorithmica, 2016, 76 : 536 - 568
  • [6] Baker game and polynomial-time approximation schemes
    Dvorak, Zdenek
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2227 - 2240
  • [7] Baker game and polynomial-time approximation schemes
    Dvorak, Zdenek
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2227 - 2240
  • [8] Polynomial-time approximation schemes for geometric graphs
    Erlebach, T
    Jansen, K
    Seidel, E
    [J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 671 - 679
  • [9] Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems
    Jonsson, Peter
    Krokhin, Andrei
    Kuivinen, Fredrik
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2007, 4649 : 182 - +
  • [10] Thin graph classes and polynomial-time approximation schemes
    Dvorak, Zdenek
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1685 - 1701
12345