Directed Steiner trees with diffusion costs
DOI10.1007/S10878-015-9925-3zbMATH Open1356.90152OpenAlexW2219735116MaRDI QIDQ346492FDOQ346492
Authors: Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, D. Barth 
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9925-3
Recommendations
- Directed Steiner tree with branching constraint
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- Steiner problems with limited number of branching nodes
- scientific article; zbMATH DE number 1303557
- Multi-rooted greedy approximation of directed Steiner trees with applications
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A threshold of ln n for approximating set cover
- Reducibility among combinatorial problems
- Polylogarithmic inapproximability
- Finding optimum branchings
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- Steiner tree problems in telecommunications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast algorithm for Steiner trees
- The Steiner cycle polytope
- An approximation for minimum multicast route in optical networks with nonsplitting nodes
- An improved approximation scheme for the Group Steiner Problem
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
- Steiner problems with limited number of branching nodes
- Directed Steiner tree with branching constraint
- Approximability of the minimum Steiner cycle problem
- Title not available (Why is that?)
- The steiner problem in graphs
- A note on distributed multicast routing in point-to-point networks
- A note on optical network with nonsplitting nodes
Cited In (10)
- Steiner problems with limited number of branching nodes
- Directed Steiner tree with branching constraint
- On the terminal connection problem
- On the computational difficulty of the terminal connection problem
- A multivariate analysis of the strict terminal connection problem
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems
- Clearing directed subgraphs by mobile agents. Variations on covering with paths
- Optimisation of electrical network configuration: complexity and algorithms for ring topologies
- Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
Uses Software
This page was built for publication: Directed Steiner trees with diffusion costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346492)
