Computing directed Steiner path covers
From MaRDI portal
Publication:2125222
DOI10.1007/s10878-021-00781-7zbMath1490.90249arXiv2012.12232OpenAlexW3186352619MaRDI QIDQ2125222
Jochen Rethmann, Dominique Komander, Frank Gurski, Carolin Rehs, Egon Wanke
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.12232
combinatorial optimizationdirected co-graphsbinary integer programdirected Hamiltonian path problemdirected Steiner path cover problemdirected Steiner path problempick-and-place machines
Cites Work
- Unnamed Item
- Unnamed Item
- Production planning problems in printed circuit board assembly
- Directed NLC-width
- Complement reducible graphs
- Directed path-width and directed tree-width of directed co-graphs
- Partial homology relations -- satisfiability in terms of di-cographs
- An optimal path cover algorithm for cographs
- Improved Steiner tree algorithms for bounded treewidth
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
- Oriented coloring on recursively defined digraphs
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- Exact solutions for the Steiner path cover problem on special graph classes
- The Steiner cycle and path cover problem on interval graphs
- How to compute digraph width measures on directed co-graphs
- Computing digraph width measures on directed co-graphs (extended abstract)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- Digraph width measures in parameterized algorithmics
- Fully dynamic recognition algorithm and certificate for directed cographs
- Arc-Disjoint Paths in Decomposable Digraphs
- Intractability of Clique-Width Parameterizations
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
- Steiner trees, partial 2–trees, and minimum IFI networks
- A complete axiomatisation for the inclusion of series-parallel partial orders
- Classes of Directed Graphs
This page was built for publication: Computing directed Steiner path covers
