Directed Steiner Tree with Branching Constraint

DOI10.1007/978-3-319-08783-2_23zbMath1423.68359OpenAlexW156515785MaRDI QIDQ2920465

Cédric Bentz, Dimitri Watel, Marc-Antoine Weisser, Dominique Barith

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_23

zbMATH Keywords

approximationdiffusing nodedirected Steiner tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (3)

Directed Steiner trees with diffusion costs ⋮ An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes ⋮ Clearing directed subgraphs by mobile agents. Variations on covering with paths

This page was built for publication: Directed Steiner Tree with Branching Constraint