An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.53 ◽

2012 ◽

Author(s):

David Eisenstat ◽

Philip Klein ◽

Claire Mathieu

Keyword(s):

Polynomial Time ◽

Planar Graphs ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Steiner Forest ◽

Polynomial Time Approximation

Download Full-text

An efficient polynomial time approximation scheme for the vertex cover P_ 3 problem on planar graphs

Discussiones Mathematicae Graph Theory ◽

10.7151/dmgt.2060 ◽

2019 ◽

Vol 39 (1) ◽

pp. 55 ◽

Author(s):

Yongtang Shi ◽

Jianhua Tu

Keyword(s):

Polynomial Time ◽

Planar Graphs ◽

Approximation Scheme ◽

Vertex Cover ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

ACM Transactions on Algorithms ◽

10.1145/2629654 ◽

2015 ◽

Vol 11 (3) ◽

pp. 1-20 ◽

Author(s):

Glencora Borradaile ◽

Philip N. Klein ◽

Claire Mathieu

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Steiner Forest ◽

Polynomial Time Approximation

Download Full-text

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2019.00042 ◽

2019 ◽

Author(s):

Vincent Cohen-Addad ◽

Michal Pilipczuk ◽

Marcin Pilipczuk

Keyword(s):

Facility Location ◽

Polynomial Time ◽

Planar Graphs ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

2008 49th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2008.59 ◽

2008 ◽

Author(s):

Glencora Borradaile ◽

Philip N. Klein ◽

Claire Mathieu

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Steiner Forest ◽

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 ◽

Author(s):

Matteo Fischetti

Keyword(s):

Polynomial Time ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Subset Sum Problem ◽

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 ◽

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 ◽

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 ◽

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