Minimum cost flow‐dependent communication networks

DOI10.1002/net.20118zbMath1103.90031OpenAlexW4242484817WikidataQ61714629 ScholiaQ61714629MaRDI QIDQ5487822

Doreen Anne Thomas, Jia Feng Weng

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20118

zbMATH Keywords

communication networkSteiner treeGilbert networkflow-dependent network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (4)

Maximising the worth of nascent networks ⋮ The Gilbert arborescence problem ⋮ Computing Steiner points for gradient-constrained minimum networks ⋮ COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ₁ AND ℓ₂ METRIC SPACES

Cites Work

• Unnamed Item

This page was built for publication: Minimum cost flow‐dependent communication networks