On Hop-Constrained Steiner Trees in Tree-Like Metrics
From MaRDI portal
(Redirected from Publication:5864216)
Recommendations
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
- The Steiner tree problem with hop constraints
- On the hop constrained Steiner tree problem with multiple root nodes
- Hop constrained Steiner trees with multiple root nodes
- Constrained Steiner trees in Halin graphs
- Contraction-based Steiner tree approximations in practice
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Constrained spanning, Steiner trees and the triangle inequality
- Diameter-constrained Steiner trees
- scientific article; zbMATH DE number 1834686
Cites work
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- A tight bound on approximating arbitrary metrics by tree metrics
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
- Approximating \(k\)-hop minimum-spanning trees
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
- Bounded-hop communication networks
- Bypassing the embedding
- Fourier meets M\"{o}bius: fast subset convolution
- Generalized submodular cover problems and applications
- Greedy Strikes Back: Improved Facility Location Algorithms
- Highway dimension and provably efficient shortest path algorithms
- Highway dimension, shortest paths, and provably efficient algorithms
- scientific article; zbMATH DE number 1263225 (Why is no real title available?)
- scientific article; zbMATH DE number 6472583 (Why is no real title available?)
- Improved Steiner tree algorithms for bounded treewidth
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Narrow-Shallow-Low-Light Trees with and without Steiner Points
- Network design problems with bounded distances via shallow-light Steiner trees
- On formulations and methods for the hop-constrained minimum spanning tree problem
- On minimal graphs containing n given points
- On the History of the Minimum Spanning Tree Problem
- Parameterized algorithms
- Proof verification and the hardness of approximation problems
- Reducibility among combinatorial problems
- The projection games conjecture and the NP-hardness of n-approximating Set-Cover
- The steiner problem in graphs
- The Steiner problem with edge lengths 1 and 2
- The Steiner tree problem
- The Steiner tree problem with hop constraints
- Tree embeddings for hop-constrained network design
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- VC-dimension and shortest path algorithms
- Vojtěch Jarník's work in combinatorial optimization
Cited in
(2)
This page was built for publication: On Hop-Constrained Steiner Trees in Tree-Like Metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864216)
