Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems

Theory of Computing Systems ◽

10.1007/s00224-017-9786-5 ◽

2017 ◽

Vol 62 (3) ◽

pp. 510-532 ◽

Author(s):

Zeev Nutov

Keyword(s):

Approximation Algorithms ◽

Minimum Cost ◽

Connectivity Augmentation ◽

Node Connectivity

Download Full-text

Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation

ACM Transactions on Algorithms ◽

10.1145/2700210 ◽

2015 ◽

Vol 11 (4) ◽

pp. 1-24 ◽

Author(s):

Dániel Marx ◽

László A. Végh

Keyword(s):

Minimum Cost ◽

Edge Connectivity ◽

Connectivity Augmentation ◽

Fixed Parameter

Download Full-text

Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs

SIAM Journal on Discrete Mathematics ◽

10.1137/100818728 ◽

2013 ◽

Vol 27 (3) ◽

pp. 1450-1481 ◽

Author(s):

J. Cheriyan ◽

B. Laekhanukit

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-030-92702-8_1 ◽

2021 ◽

pp. 1-22

Author(s):

Waldo Gálvez ◽

Francisco Sanhueza-Matamala ◽

José A. Soto

Keyword(s):

Approximation Algorithms ◽

Vertex Connectivity ◽

Connectivity Augmentation

Download Full-text

Approximating Node-Connectivity Augmentation Problems

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03685-9_22 ◽

2009 ◽

pp. 286-297 ◽

Author(s):

Zeev Nutov

Keyword(s):

Connectivity Augmentation ◽

Node Connectivity

Download Full-text

Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees

Systems and Computers in Japan ◽

10.1002/scj.4690170307 ◽

1986 ◽

Vol 17 (3) ◽

pp. 56-65

Author(s):

Toshimitsu Masuzawa ◽

Ken'ichi Hagihara ◽

Nobuki Tokura ◽

Koichi Wada

Keyword(s):

Time Algorithm ◽

Optimal Time ◽

Connectivity Augmentation ◽

Node Connectivity

Download Full-text

NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

Journal of Algorithms ◽

10.1006/jagm.1995.0800 ◽

1997 ◽

Vol 22 (1) ◽

pp. 187-196 ◽

Author(s):

Michal Penn ◽

Haya Shasha-Krupnik

Keyword(s):

Approximation Algorithms ◽

Vertex Connectivity ◽

Connectivity Augmentation

Download Full-text

Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

Journal of Algorithms ◽

10.1006/jagm.1999.1040 ◽

1999 ◽

Vol 33 (1) ◽

pp. 15-50 ◽

Author(s):

Joseph Cheriyan ◽

Ramakrishna Thurimella

Keyword(s):

Fast Algorithms ◽

Connectivity Augmentation ◽

Node Connectivity

Download Full-text

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

Algorithmica ◽

10.1007/s00453-001-0038-2 ◽

2001 ◽

Vol 31 (1) ◽

pp. 58-78 ◽

Author(s):

R. Ravi ◽

M. V. Marathe ◽

S. S. Ravi ◽

D. J. Rosenkrantz ◽

H. B. Hunt III

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Minimum Cost ◽

Design Problems ◽

Network Design Problems

Download Full-text

Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph

1993 IEEE International Symposium on Circuits and Systems ◽

10.1109/iscas.1993.394287 ◽

2002 ◽

Author(s):

T. Watanabe ◽

T. Mashima ◽

S. Taoka

Keyword(s):

Approximation Algorithms ◽

Download Full-text

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2012.30 ◽

2012 ◽

Author(s):

Takuro Fukunaga ◽

R. Ravi

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Node Connectivity

Download Full-text