The parameterized complexity of the survivable network design problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Improved approximation algorithms for directed Steiner forest
A factor 2 approximation algorithm for the generalized Steiner network problem
The \(k\)-path tree matroid and its applications to survivable network design
The Steiner tree problem on graphs: inapproximability results
On the parameterized complexity of multiple-interval graph problems
Diameter and treewidth in minor-closed graph families
Path-contractions, edge deletions and connectivity preservation
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Dynamic programming for minimum Steiner trees
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Designing hierarchical survivable networks
A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
An O ( n log n ) approximation scheme for Steiner tree in planar graphs
Approximating minimum-cost connectivity problems via uncrossable bifamilies
The Design of Approximation Algorithms
Iterative Methods in Combinatorial Optimization
Set connectivity problems in undirected graphs and the directed steiner network problem
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests
Easy problems for tree-decomposable graphs
Fourier meets M\"{o}bius: fast subset convolution
Polylogarithmic inapproximability
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
On the Computational Complexity of Combinatorial Problems
On some connectivity properties of Eulerian graphs
A Reduction Method for Edge-Connectivity in Graphs
Color-coding
Erratum
Hardness of Approximation for Vertex-Connectivity Network Design Problems
Approximation Algorithms for Directed Steiner Problems
Packing element-disjoint steiner trees
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
Design of Survivable Networks: A survey
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Steiner Tree Approximation via Iterative Randomized Rounding
Parameterized Algorithms
The steiner problem in graphs
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Fast exact algorithms for survivable network design with uniform requirements
Steiner tree problems
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
Solving Steiner trees: Recent advances, challenges, and perspectives
The parameterized complexity of the survivable network design problem

This page was built for publication: The parameterized complexity of the survivable network design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655676)