Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
DOI10.4230/LIPICS.SOCG.2016.39zbMATH Open1387.68180OpenAlexW2472796018MaRDI QIDQ3132873FDOQ3132873
Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Saket Saurabh
Publication date: 30 January 2018
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5931/pdf/LIPIcs-SoCG-2016-39.pdf/
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (10)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- Title not available (Why is that?)
- Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
- Path-Contractions, Edge Deletions and Connectivity Preservation
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
- Title not available (Why is that?)
- The complexity of tree partitioning
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Finding even subgraphs even faster
- Title not available (Why is that?)
This page was built for publication: Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132873)
