Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
From MaRDI portal
Publication:4943071
DOI10.1006/jagm.1999.1020zbMath0949.68177OpenAlexW2030145967MaRDI QIDQ4943071
Publication date: 16 March 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1020
Related Items (13)
A note on the subtree ordered median problem in networks based on nestedness property ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Algorithms for central-median paths with bounded length on trees ⋮ Extensive facility location problems on networks: an updated review ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ A note on the nestedness property for ordered median problems in tree networks ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Finding the conditional location of a median path on a tree ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ Minimax regret path location on trees ⋮ Optimal algorithms for the path/tree-shaped facility location problems in trees ⋮ On the minmax regret path median problem on trees
This page was built for publication: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
