Pages that link to "Item:Q4943071"
From MaRDI portal
The following pages link to Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network (Q4943071):
Displaying 16 items.
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- A note on the nestedness property for ordered median problems in tree networks (Q394466) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- A note on the subtree ordered median problem in networks based on nestedness property (Q2358843) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe (Q3688127) (← links)
