Algorithms for the constrained maximum-weight connected graph problem

DOI<985::AID-NAV4>3.0.CO;2-9 10.1002/(SICI)1520-6750(199610)43:7<985::AID-NAV4>3.0.CO;2-9zbMath0868.90131OpenAlexW2091895894MaRDI QIDQ5689649

Heungsoon Felix Lee, Daniel R. Dooly

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199610)43:7<985::aid-nav4>3.0.co;2-9

zbMATH Keywords

Steiner tree problemheuristicmaximum-weight connected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (2)

Vertex covering with capacitated trees ⋮ Exploring the constrained maximum edge-weight connected graph problem

This page was built for publication: Algorithms for the constrained maximum-weight connected graph problem