Two-level hub Steiner trees
From MaRDI portal
Publication:2059893
DOI10.1016/j.ipl.2021.106209OpenAlexW3205039183MaRDI QIDQ2059893
Oleksandr Rudenko, Ziye Tang, R. Ravi, Takuro Fukunaga
Publication date: 14 December 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106209
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- Location-routing: issues, models and methods
- Network hub location problems: The state of the art
- Approximating the Single-Sink Link-Installation Problem in Network Design
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
- Simpler and better approximation algorithms for network design
- A Constant Factor Approximation for the Single Sink Edge Installation Problem
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Analytical approach to parallel repetition
- On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem
- Steiner Tree Approximation via Iterative Randomized Rounding
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
This page was built for publication: Two-level hub Steiner trees
