A minimum-length covering subtree of a tree

DOI<309::AID-NAV3220370209>3.0.CO;2-8 10.1002/1520-6750(199004)37:2<309::AID-NAV3220370209>3.0.CO;2-8zbMath0701.90056OpenAlexW2091044862MaRDI QIDQ3479805

Richard L. Francis, Timothy J. Lowe, James E. Ward, Tae Ung Kim

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199004)37:2<309::aid-nav3220370209>3.0.co;2-8

zbMATH Keywords

tree networkcentral facilityminimum cardinality point coversubtree r-cover problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Indirect covering tree problems on spanning tree networks ⋮ Comments on: ``Extensive facility location problems on networks: an updated review ⋮ A review of extensive facility location in networks ⋮ Efficient solution methods for covering tree problems ⋮ A unifying location model on tree graphs based on submodularity property

Cites Work

• Unnamed Item
• Minimax location problems with nonlinear costs
• A note on a nonlinear minimax location problem in tree networks

This page was built for publication: A minimum-length covering subtree of a tree