On the minimum diameter cost-constrained Steiner tree problem

DOI10.1007/978-3-642-31770-5_4MaRDI QIDQ3167347zbMATH OpenOpenAlexFDO

Authors Wei Ding, Guoliang Xue

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31770-5_4

zbMATH Keywords

cost-constrained Steiner treefixed topologyminimum diameterweakly fully polynomial time approximation scheme

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Minimum diameter cost-constrained Steiner trees
• Diameter-constrained Steiner tree
• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
• Minimum restricted diameter spanning trees.
• Minimum diameter vertex-weighted Steiner tree

Cited in

(9)

• On the restricted 1-Steiner tree problem
• Minimum diameter vertex-weighted Steiner tree
• Minimum diameter cost-constrained Steiner trees
• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
• Diameter-constrained Steiner trees
• Diameter-constrained Steiner tree
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• scientific article; zbMATH DE number 5629773 (Why is no real title available?)
• scientific article; zbMATH DE number 5629898 (Why is no real title available?)

This page was built for publication: On the minimum diameter cost-constrained Steiner tree problem

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