An ETH-tight algorithm for bidirected Steiner connectivity

Cites Work

Unnamed Item
Unnamed Item
Improved approximation algorithms for directed Steiner forest
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
The Steiner tree problem on graphs: inapproximability results
The Steiner problem with edge lengths 1 and 2
Finding even subgraphs even faster
A matroid approach to finding edge connectivity and packing arborescences
Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
Approximation algorithms for spanner problems and directed Steiner forest
Dual power assignment optimization and fault tolerance in WSNs
An 11/6-approximation algorithm for the network Steiner problem
Dynamic programming for minimum Steiner trees
Design networks with bounded pairwise distance
Fixed-Parameter and Approximation Algorithms: A New Look
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
Set connectivity problems in undirected graphs and the directed steiner network problem
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
Fourier meets M\"{o}bius: fast subset convolution
Approximation Algorithms for Several Graph Augmentation Problems
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
Kernelization Lower Bounds Through Colors and IDs
On Problems as Hard as CNF-SAT
Approximating Spanners and Directed Steiner Forest
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
Reducibility among Combinatorial Problems
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
Representative Sets and Irrelevant Vertices
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Steiner Tree Approximation via Iterative Randomized Rounding
Matroids and integrality gaps for hypergraphic steiner tree relaxations
The steiner problem in graphs
Parameterized Complexity of Arc-Weighted Directed Steiner Problems

This page was built for publication: An ETH-tight algorithm for bidirected Steiner connectivity