The centdian subtree on tree networks
From MaRDI portal
Publication:1602695
DOI10.1016/S0166-218X(01)00199-8zbMath1016.68063WikidataQ58217360 ScholiaQ58217360MaRDI QIDQ1602695
Justo Puerto, Arie Tamir, Dionisio Perez-Britos
Publication date: 24 June 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
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, The Connected p-Centdian Problem on Block Graphs, Extensive facility location problems on networks: an updated review, On discrete optimization with ordering, Revisiting \(k\)-sum optimization, A linear time algorithm for connected \(p\)-centdian problem on block graphs, A note on the nestedness property for ordered median problems in tree networks, The extensive 1-median problem with radius on networks, An improved algorithm for the minmax regret path center problem on trees, The connected \(p\)-center problem on block graphs with forbidden vertices, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Comparing different metaheuristic approaches for the median path problem with bounded length, Finding the conditional location of a median path on a tree, The 2-radius and 2-radiian problems on trees, Ordered weighted average optimization in multiobjective spanning tree problem, Locating tree-shaped facilities using the ordered median objective, Range minimization problems in path-facility location on trees, The continuous and discrete path‐variance problems on trees, Algorithms for connected \(p\)-centdian problem on block graphs, On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges, An algorithm for solving the bi-objective median path-shaped facility on a tree network, Extensive facility location problems on networks with equity measures, Optimal algorithms for the path/tree-shaped facility location problems in trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- Location of paths on trees with minimal eccentricity and superior section
- On the sum-max bicriterion path problem.
- Algorithms for path medi-centers of a tree
- On locating path- or tree-shaped facilities on networks
- Algorithms for a Core and k-Tree Core of a Tree
- Generalized Selection and Ranking: Sorted Matrices
- On finding the core of a tree with a specified length
- Medi-centre Location Problems
- New Results on the Complexity of p-Centre Problems
- The optimal location of a path or tree in a tree network
- Medi-Centers of a Tree
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- The generalized P‐forest problem on a tree network
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- A polynomial algorithm for thep-centdian problem on a tree
- Slowing down sorting networks to obtain faster sorting algorithms
- Finding kth paths and p-centers by generating and searching good data structures
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
