Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

DOI10.1006/JAGM.1999.1020MaRDI QIDQ4943071zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang

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

zbMATH Keywords

parallel algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Algorithms for path medi-centers of a tree
• The optimal location of a path or tree in a tree network
• Algorithms and Computation
• Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
• Optimal algorithms for the path/tree-shaped facility location problems in trees

Cited in

(17)

• A note on the nestedness property for ordered median problems in tree networks
• On the minmax regret path median problem on trees
• Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
• Efficient algorithms for the minmax regret path center problem with length constraint on trees
• Locating tree-shaped facilities using the ordered median objective
• An improved algorithm for the minmax regret path center problem on trees
• An optimal parallel algorithm for computing furthest neighbors in a tree
• Extensive facility location problems on networks: an updated review
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• Algorithms for central-median paths with bounded length on trees
• An efficient algorithm for the length-constrained heaviest path problem on a tree
• Minimax regret path location on trees
• Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe
• A note on the subtree ordered median problem in networks based on nestedness property
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Finding the conditional location of a median path on a tree
• An improved algorithm for the minmax regret path centdian 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943071)