scientific article; zbMATH DE number 5173832
From MaRDI portal
Publication:5294062
zbMath1118.90025MaRDI QIDQ5294062
Publication date: 23 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items
Optimal capacitated ring trees ⋮ Directed Steiner trees with diffusion costs ⋮ A practical greedy approximation for the directed Steiner tree problem ⋮ A Practical Greedy Approximation for the Directed Steiner Tree Problem ⋮ The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes ⋮ Breakout local search for the Steiner tree problem with revenue, budget and hop constraints ⋮ The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Complexity of Steiner Tree in Split Graphs - Dichotomy Results ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Steiner Problems with Limited Number of Branching Nodes
This page was built for publication:
