A new linear storage, polynomial-time approximation scheme for the subset-sum problem

Matteo Fischetti

doi:10.1016/0166-218x(90)90021-4

A new linear storage, polynomial-time approximation scheme for the subset-sum problem

Discrete Applied Mathematics ◽

10.1016/0166-218x(90)90021-4 ◽

1990 ◽

Vol 26 (1) ◽

pp. 61-77 ◽

Cited By ~ 4

Author(s):

Matteo Fischetti

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Subset Sum Problem ◽

Subset Sum ◽

Polynomial Time Approximation

Download Full-text

A new fully polynomial time approximation scheme for the interval subset sum problem

Journal of Global Optimization ◽

10.1007/s10898-017-0514-0 ◽

2017 ◽

Vol 68 (4) ◽

pp. 749-775

Author(s):

Rui Diao ◽

Ya-Feng Liu ◽

Yu-Hong Dai

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Subset Sum Problem ◽

Subset Sum ◽

Polynomial Time Approximation

Download Full-text

Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation

Lecture Notes in Computer Science - Numerical Computations: Theory and Algorithms ◽

10.1007/978-3-030-40616-5_36 ◽

2020 ◽

pp. 400-405

Author(s):

Vladimir Khandeev

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Quadratic Variation ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A polynomial time approximation scheme for euclidean minimum cost k-connectivity

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/bfb0055093 ◽

1998 ◽

pp. 682-694 ◽

Cited By ~ 5

Author(s):

Artur Czumaj ◽

Andrzej Lingas

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Minimum Cost ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Polynomial Time Approximation Scheme for the Square Packing Problem

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-540-68891-4_13 ◽

2008 ◽

pp. 184-198 ◽

Cited By ~ 7

Author(s):

Klaus Jansen ◽

Roberto Solis-Oba

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Packing Problem ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Square Packing ◽

Polynomial Time Approximation

Download Full-text

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_24 ◽

2008 ◽

pp. 255-264

Author(s):

Zhao Zhang ◽

Xiaofeng Gao ◽

Weili Wu

Keyword(s):

Unit Disk ◽

Polynomial Time ◽

Approximation Scheme ◽

Vertex Cover ◽

Unit Disk Graph ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Connected Vertex Cover ◽

Connected Vertex ◽

Polynomial Time Approximation

Download Full-text

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares

Algorithm Theory – SWAT 2012 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-31155-0_3 ◽

2012 ◽

pp. 24-35 ◽

Cited By ~ 3

Author(s):

Takehiro Ito ◽

Shin-Ichi Nakano ◽

Yoshio Okamoto ◽

Yota Otachi ◽

Ryuhei Uehara ◽

...

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Coverage Problem ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-45678-3_4 ◽

2001 ◽

pp. 36-48 ◽

Cited By ~ 7

Author(s):

Yoshiyuki Karuno ◽

Hiroshi Nagamochi

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Vehicle Scheduling ◽

Scheduling Problem ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Algorithmic Aspects of Cloud Computing - Lecture Notes in Computer Science ◽

10.1007/978-3-030-19759-9_5 ◽

2019 ◽

pp. 59-72 ◽

Cited By ~ 3

Author(s):

Frank Neumann ◽

Sergey Polyakovskiy ◽

Martin Skutella ◽

Leen Stougie ◽

Junhua Wu

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

European Journal of Operational Research ◽

10.1016/j.ejor.2019.12.003 ◽

2020 ◽

Vol 284 (1) ◽

pp. 67-74 ◽

Cited By ~ 1

Author(s):

Xin Chen ◽

Yage Liang ◽

Małgorzata Sterna ◽

Wen Wang ◽

Jacek Błażewicz

Keyword(s):

Polynomial Time ◽

Parallel Machines ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Due Date ◽

Common Due Date ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs

Engineering Optimization ◽

10.1080/0305215x.2018.1558446 ◽

2019 ◽

Vol 51 (11) ◽

pp. 1938-1943 ◽

Cited By ~ 1

Author(s):

Chuanli Zhao ◽

Chou-Jung Hsu

Keyword(s):

Polynomial Time ◽

Single Machine ◽

Approximation Scheme ◽

Deteriorating Jobs ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text