Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
From MaRDI portal
Cites work
- A subexponential parameterized algorithm for subset TSP on planar graphs
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
- A tight lower bound for planar multiway cut with fixed number of terminals
- Approximation Algorithms for Directed Steiner Problems
- Approximation algorithms for spanner problems and directed Steiner forest
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- Detecting and counting small patterns in planar graphs in subexponential parameterized time
- Fourier meets M\"{o}bius: fast subset convolution
- scientific article; zbMATH DE number 6783450 (Why is no real title available?)
- scientific article; zbMATH DE number 3384060 (Why is no real title available?)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals
- On subexponential parameterized algorithms for Steiner tree and directed subset TSP on planar graphs
- Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams
- Parameterized algorithms
- Parameterized approximation algorithms for bidirected Steiner network problems
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- Parameterized complexity of arc-weighted directed Steiner problems
- Reducibility among combinatorial problems
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- Steiner problem in networks: A survey
- Steiner's problem in graphs and its implications
- Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering
- Subexponential parameterized odd cycle transversal on planar graphs
- The complexity landscape of fixed-parameter directed Steiner network problems
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- The point-to-point connection problem - analysis and algorithms
- The point-to-point delivery and connection problems: Complexity and algorithms
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
This page was built for publication: Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875131)
