Optimal algorithms for the path/tree-shaped facility location problems in trees
From MaRDI portal
Recommendations
- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
- Conditional location of path and tree shaped facilities on trees
- The optimal location of a path or tree in a tree network
- On locating path- or tree-shaped facilities on networks
- Range minimization problems in path-facility location on trees
Cites work
- A review of extensive facility location in networks
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
- Conditional location of path and tree shaped facilities on trees
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- Finding kth paths and p-centers by generating and searching good data structures
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 1091558 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- On locating path- or tree-shaped facilities on networks
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Technical Note—Conditional Location Problems on Networks
- The centdian subtree on tree networks
- The optimal location of a path or tree in a tree network
Cited in
(22)- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Extensive facility location problems on networks: an updated review
- The nestedness property of location problems on the line
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- An improved algorithm for the minmax regret path center problem on trees
- An algorithm for solving the bi-objective median path-shaped facility on a tree network
- Minimax regret path location on trees
- On locating path- or tree-shaped facilities on networks
- Optimal location of a path or tree on a network with cycles
- The general facility location problem with connectivity on trees
- scientific article; zbMATH DE number 2119651 (Why is no real title available?)
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- scientific article; zbMATH DE number 7378709 (Why is no real title available?)
- An effective algorithm for the two-stage location problem on a tree-like network
- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
- Conditional location of path and tree shaped facilities on trees
- On fixed-parameter solvability of the minimax path location problem
- The extensive 1-median problem with radius on networks
- An integrated approach for allocation and scheduling-location problems on graphs
- Combinatorial algorithms for the minmax robust median subtree problem on tree networks with interval vertex weights
- Range minimization problems in path-facility location on trees
This page was built for publication: Optimal algorithms for the path/tree-shaped facility location problems in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031869)
