Parameterized Algorithms to Preserve Connectivity

DOI10.1007/978-3-662-43948-7_66zbMath1412.68078OpenAlexW359386717WikidataQ60488403 ScholiaQ60488403MaRDI QIDQ5167793

Petr A. Golovach, Saket Saurabh, Fedor V. Fomin, Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_66

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (16)

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree ⋮ Node connectivity augmentation via iterative randomized rounding ⋮ On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Path-contractions, edge deletions and connectivity preservation ⋮ On the cycle augmentation problem: hardness and approximation algorithms ⋮ A polylogarithmic approximation algorithm for 2-edge-connected dominating set ⋮ 2-node-connectivity network design ⋮ Fast exact algorithms for survivable network design with uniform requirements ⋮ Path-Contractions, Edge Deletions and Connectivity Preservation ⋮ Approximation algorithms for vertex-connectivity augmentation on the cycle ⋮ Approximation algorithms for connectivity augmentation problems ⋮ 2-node-connectivity network design

This page was built for publication: Parameterized Algorithms to Preserve Connectivity