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

DOI10.1007/S00224-015-9615-7MaRDI QIDQ255267zbMATHOpenAlexFDO

Authors 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 algorithmsbicriteria network designbounded diameterminimum Steiner tree

Mathematics Subject Classification ID

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

Recommendations

• Diameter-constrained Steiner tree
• Bounded-diameter minimum-cost graph problems
• Minimum diameter cost-constrained Steiner trees
• On the minimum diameter cost-constrained Steiner tree problem
• Minimum diameter vertex-weighted Steiner tree

Cites work

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

Cited in

(8)

• Delay-constrained minimum shortest path trees and related problems
• Diameter-constrained Steiner tree
• On the minimum diameter cost-constrained Steiner tree problem
• Bounded-diameter minimum-cost graph problems
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
• Minimum diameter cost-constrained Steiner trees
• Diameter-constrained Steiner trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255267)