scientific article; zbMATH DE number 7378612
From MaRDI portal
Publication:5009490
DOI10.4230/LIPIcs.IPEC.2018.26MaRDI QIDQ5009490
Édouard Bonnet, Florian Sikora
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- The Steiner tree problem on graphs: inapproximability results
- The Steiner tree problem
- Exploiting treewidth for projected model counting and its limits
- Computing tree width: from theory to practice and back
- SAT-encodings for special treewidth and pathwidth
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Computation and growth of road network dimensions
- Practical access to dynamic programming on tree decompositions
- Answer set solving with bounded treewidth revisited
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Fourier meets M\"{o}bius: fast subset convolution
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Jdrasil: A Modular Library for Computing Tree Decompositions
- Kernelization Lower Bounds Through Colors and IDs
- Positive-Instance Driven Dynamic Programming for Treewidth.
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Computing treewidth on the GPU
- Tighter Bounds for Graph Steiner Tree Approximation
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
- Steiner Tree Approximation via Iterative Randomized Rounding
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Steiner Minimal Trees
- The steiner problem in graphs
This page was built for publication:
