When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem

DOI10.1007/s00224-015-9615-7zbMath1336.05039OpenAlexW2026902273MaRDI QIDQ255267

Ali Mashreghi, Alireza Zarei

Publication date: 9 March 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9615-7

zbMATH Keywords

approximation algorithmsminimum Steiner treebicriteria network designbounded diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Delay-constrained minimum shortest path trees and related problems

Cites Work

• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
• An improved FPTAS for Restricted Shortest Path.
• Bounded-diameter minimum-cost graph problems
• md-MST is NP-hard for
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
• Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• A Greedy Heuristic for the Set-Covering Problem
• Approximation Schemes for the Restricted Shortest Path Problem
• Bicriteria Network Design Problems
• The constrained minimum spanning tree problem
• Multicriteria Optimization
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem