On the Minimum Diameter Cost-Constrained Steiner Tree Problem

DOI10.1007/978-3-642-31770-5_4zbMATH Open1301.05319OpenAlexW2231625632MaRDI QIDQ3167347FDOQ3167347

Guoliang Xue, Wei Ding

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

fixed topologyminimum diametercost-constrained Steiner treeweakly fully polynomial time approximation scheme

Mathematics Subject Classification ID

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

Cited In (6)

• On the restricted 1-Steiner tree problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum diameter vertex-weighted Steiner tree
• Diameter-constrained Steiner trees
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

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)