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 fully polynomial time approximation scheme for timing driven minimum cost buffer insertion

Proceedings of the 46th Annual Design Automation Conference on ZZZ - DAC '09 ◽

10.1145/1629911.1630026 ◽

2009 ◽

Cited By ~ 8

Author(s):

Shiyan Hu ◽

Zhuo Li ◽

Charles J. Alpert

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Minimum Cost ◽

Buffer Insertion ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

Algorithmica ◽

10.1007/s00453-004-1119-9 ◽

2004 ◽

Vol 41 (1) ◽

pp. 53-72 ◽

Cited By ~ 9

Author(s):

Guoliang Xue ◽

Wei Xiao

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Minimum Cost ◽

Multicast Tree ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A polynomial time approximation scheme for timing constrained minimum cost layer assignment

2008 IEEE/ACM International Conference on Computer-Aided Design ◽

10.1109/iccad.2008.4681560 ◽

2008 ◽

Author(s):

Shiyan Hu ◽

Zhuo Li ◽

Charles J. Alpert

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Minimum Cost ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Layer Assignment ◽

Polynomial Time Approximation

Download Full-text

A fully polynomial time approximation scheme for minimum cost-reliability ratio problems

Discrete Applied Mathematics ◽

10.1016/0166-218x(92)90038-c ◽

1992 ◽

Vol 35 (2) ◽

pp. 143-155 ◽

Cited By ~ 5

Author(s):

N. Katoh

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Minimum Cost ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment

IEEE Transactions on Circuits & Systems II Express Briefs ◽

10.1109/tcsii.2009.2022203 ◽

2009 ◽

Vol 56 (7) ◽

pp. 580-584 ◽

Cited By ~ 4

Author(s):

Shiyan Hu ◽

Zhuo Li ◽

C.J. Alpert

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Minimum Cost ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Layer Assignment ◽

Polynomial Time Approximation

Download Full-text

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

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 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