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 条

[41] Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
M. Karpinski
[J]. Algorithmica, 2001, 30 : 386 - 397
[42] Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
Karpinski, M
[J]. ALGORITHMICA, 2001, 30 (03) : 386 - 397
[43] Pooling Problems with Polynomial-Time Algorithms
Dag Haugland
Eligius M. T. Hendrix
[J]. Journal of Optimization Theory and Applications, 2016, 170 : 591 - 615
[44] A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
Ben-Ameur, Walid
Neto, Jose
[J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (16) : 1689 - 1698
[45] Deterministic and randomized polynomial-time approximation of radii
Brieden, A
Gritzmann, P
Kannan, R
Klee, V
Lovász, L
Simonovits, M
[J]. MATHEMATIKA, 2001, 48 (95-96) : 63 - 105
[46] ON COUNTING PROBLEMS AND THE POLYNOMIAL-TIME HIERARCHY
ANGLUIN, D
[J]. THEORETICAL COMPUTER SCIENCE, 1980, 12 (02) : 161 - 173
[47] Pooling Problems with Polynomial-Time Algorithms
Haugland, Dag
Hendrix, Eligius M. T.
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2016, 170 (02) : 591 - 615
[48] MAX SAT approximation beyond the limits of polynomial-time approximation
Dantsin, E
Gavrilovich, M
Hirsch, EA
Konev, B
[J]. ANNALS OF PURE AND APPLIED LOGIC, 2002, 113 (1-3) : 81 - 94
[49] Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
Kubzin, MA
Strusevich, VA
Breit, J
Schimidt, G
[J]. NAVAL RESEARCH LOGISTICS, 2006, 53 (01) : 16 - 23
[50] Multi-Objective Constrained Vehicle Refueling Planning: Complexity and Polynomial-Time Approximation Schemes
Lin, Shieu-Hong
[J]. 2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2015, : 1188 - 1192

← 1 2 3 4 5 →