Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384301 ◽

2020 ◽

Author(s):

Jarosław Byrka ◽

Fabrizio Grandoni ◽

Afrouz Jabal Ameli

Keyword(s):

Steiner Tree ◽

Connectivity Augmentation

Download Full-text

The Steiner Tree Problem

10.1016/s0167-5060(08)x7008-6 ◽

1992 ◽

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Structured Connectivity Augmentation

SIAM Journal on Discrete Mathematics ◽

10.1137/17m1146233 ◽

2018 ◽

Vol 32 (4) ◽

pp. 2612-2635

Author(s):

Fedor V. Fomin ◽

Petr A. Golovach ◽

Dimitrios M. Thilikos

Keyword(s):

Connectivity Augmentation

Download Full-text

Solving the Steiner Tree Problem with few Terminals

2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI) ◽

10.1109/ictai50040.2020.00054 ◽

2020 ◽

Author(s):

Johannes K. Fichte ◽

Markus Hecher ◽

Andre Schidler

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Subgraph Induced Planar Connectivity Augmentation

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-39890-5_23 ◽

2003 ◽

pp. 261-272 ◽

Cited By ~ 6

Author(s):

Carsten Gutwenger ◽

Michael Jünger ◽

Sebastian Leipert ◽

Petra Mutzel ◽

Merijam Percan ◽

...

Keyword(s):

Connectivity Augmentation

Download Full-text

Solving the Steiner tree problem in graphs by chaotic search

Nonlinear Theory and Its Applications IEICE ◽

10.1587/nolta.11.90 ◽

2020 ◽

Vol 11 (1) ◽

pp. 90-108

Author(s):

Misa Fujita ◽

Takayuki Kimura ◽

Tohru Ikeguchi

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem ◽

Chaotic Search

Download Full-text

An online genetic algorithm for dynamic Steiner tree problem

2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies and Industrial Opportunities (Cat. No.00CH37141) ◽

10.1109/iecon.2000.972227 ◽

2002 ◽

Cited By ~ 7

Author(s):

S. Ding ◽

N. Ishii

Keyword(s):

Genetic Algorithm ◽

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network

2010 Proceedings IEEE INFOCOM ◽

10.1109/infcom.2010.5462182 ◽

2010 ◽

Cited By ~ 10

Author(s):

Dengpan Zhou ◽

Jie Gao

Keyword(s):

Sensor Network ◽

Steiner Tree ◽

Mobile Agents ◽

Minimum Steiner Tree

Download Full-text

An Improved Algorithm for the Steiner Tree Problem with Bounded Edge-length

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2021.07.003 ◽

2021 ◽

Author(s):

Chi-Yeh Chen ◽

Sun-Yuan Hsieh

Keyword(s):

Steiner Tree ◽

Edge Length ◽

Steiner Tree Problem ◽

Improved Algorithm

Download Full-text

Group steiner tree model for energy efficient multicast in Duty-Cycle Wireless Sensor Networks

2014 IEEE Fifth International Conference on Communications and Electronics (ICCE) ◽

10.1109/cce.2014.6916710 ◽

2014 ◽

Cited By ~ 2

Author(s):

Duong Nguyen Thai ◽

Hong Ngo Son ◽

Huynh T. Thanh Binh

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Duty Cycle ◽

Steiner Tree ◽

Energy Efficient ◽

Wireless Sensor ◽

Tree Model ◽

Group Steiner Tree

Download Full-text

A 1-(S,T)-edge-connectivity augmentation algorithm

Mathematical Programming ◽

10.1007/s101070050037 ◽

1999 ◽

Vol 84 (3) ◽

pp. 529-535

Author(s):

Steffen Enni

Keyword(s):

Edge Connectivity ◽

Augmentation Algorithm ◽

Connectivity Augmentation

Download Full-text