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

Dániel Marx; László A. Végh

doi:10.1145/2700210

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

ACM Transactions on Algorithms ◽

10.1145/2700210 ◽

2015 ◽

Vol 11 (4) ◽

pp. 1-24 ◽

Cited By ~ 7

Author(s):

Dániel Marx ◽

László A. Végh

Keyword(s):

Minimum Cost ◽

Edge Connectivity ◽

Connectivity Augmentation ◽

Fixed Parameter

Download Full-text

Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation

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

10.1007/978-3-642-39206-1_61 ◽

2013 ◽

pp. 721-732 ◽

Cited By ~ 3

Author(s):

Dániel Marx ◽

László A. Végh

Keyword(s):

Minimum Cost ◽

Edge Connectivity ◽

Connectivity Augmentation ◽

Fixed Parameter

Download Full-text

A(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

Theoretical Computer Science ◽

10.1016/j.tcs.2013.04.004 ◽

2013 ◽

Vol 489-490 ◽

pp. 67-74 ◽

Cited By ~ 9

Author(s):

Nachshon Cohen ◽

Zeev Nutov

Keyword(s):

Approximation Algorithm ◽

Minimum Cost ◽

Edge Connectivity ◽

Connectivity Augmentation ◽

Constant Radius

Download Full-text

A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius

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

10.1007/978-3-642-22935-0_13 ◽

2011 ◽

pp. 147-157

Author(s):

Nachshon Cohen ◽

Zeev Nutov

Keyword(s):

Approximation Algorithm ◽

Minimum Cost ◽

Edge Connectivity ◽

Connectivity Augmentation ◽

Constant Radius

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

A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem

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

10.1007/3-540-59408-6_68 ◽

1995 ◽

pp. 403-413 ◽

Cited By ~ 1

Author(s):

Hiroshi Nagamochi ◽

Toshihide Ibaraki

Keyword(s):

Splitting Algorithm ◽

Edge Connectivity ◽

Connectivity Augmentation

Download Full-text

Successive edge-connectivity augmentation problems

Mathematical Programming ◽

10.1007/s101070050041 ◽

1999 ◽

Vol 84 (3) ◽

pp. 577-593 ◽

Cited By ~ 14

Author(s):

Eddie Cheng ◽

Tibor Jordán

Keyword(s):

Edge Connectivity ◽

Connectivity Augmentation

Download Full-text

APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(the 50th Anniversary of the Operations Research Society of Japan)

Journal of the Operations Research Society of Japan ◽

10.15807/jorsj.50.339 ◽

2007 ◽

Vol 50 (4) ◽

pp. 339-349 ◽

Cited By ~ 1

Author(s):

Takuro Fukunaga ◽

Hiroshi Nagamochi

Keyword(s):

Operations Research ◽

50Th Anniversary ◽

Minimum Cost ◽

Research Society ◽

Special Issue ◽

Edge Connectivity ◽

Degree Bounds

Download Full-text

Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph

2005 IEEE International Symposium on Circuits and Systems ◽

10.1109/iscas.2005.1465066 ◽

2005 ◽

Author(s):

S. Taoka ◽

T. Watanabe ◽

T. Mashima

Keyword(s):

Maximum Weight ◽

Edge Connectivity ◽

Connectivity Augmentation ◽

Maximum Weight Matching

Download Full-text

A linear time augmenting algorithm for 3-edge-connectivity augmentation problems

1991., IEEE International Sympoisum on Circuits and Systems ◽

10.1109/iscas.1991.176575 ◽

2002 ◽

Cited By ~ 2

Author(s):

T. Watanabe ◽

M. Yamakado ◽

K. Onaga

Keyword(s):

Linear Time ◽

Edge Connectivity ◽

Connectivity Augmentation

Download Full-text

The (σ + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_14 ◽

2000 ◽

pp. 169-185 ◽

Cited By ~ 1

Author(s):

Satoshi Taoka ◽

Toshimasa Watanabe

Keyword(s):

Edge Connectivity ◽

Connectivity Augmentation ◽

Multiple Edges

Download Full-text