Showing 1 - 10 of 67
We consider a network design problem that generalizes the hop and diameter constrained Steiner tree problem as follows: Given an edge-weighted undirected graph with two disjoint subsets representing roots and terminals, find a minimum-weight subtree that spans all the roots and terminals so that...
Persistent link: https://www.econbiz.de/10011052428
Persistent link: https://www.econbiz.de/10011947974
Persistent link: https://www.econbiz.de/10011641444
Persistent link: https://www.econbiz.de/10011802301
Persistent link: https://www.econbiz.de/10014310763
Persistent link: https://www.econbiz.de/10015164533
Persistent link: https://www.econbiz.de/10011488186
Persistent link: https://www.econbiz.de/10011878363
Persistent link: https://www.econbiz.de/10011999051
Persistent link: https://www.econbiz.de/10011764100