Center location problems on tree graphs with subtree-shaped customers
From MaRDI portal
Publication:1005232
DOI10.1016/j.dam.2007.11.022zbMath1155.90418OpenAlexW2159194866WikidataQ58217256 ScholiaQ58217256MaRDI QIDQ1005232
Justo Puerto, Arie Tamir, Dionisio Perez-Britos, Juan A. Mesa
Publication date: 9 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.11.022
Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80)
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Embeddings into almost self-centered graphs of given radius, On the planar piecewise quadratic 1-center problem, The connected \(p\)-center problem on block graphs with forbidden vertices, Almost self-centered graphs, The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers, The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A recognition algorithm for the intersection graphs of paths in trees
- Finding level-ancestors in trees
- Continuous location of dimensional structures.
- A self-stabilizing algorithm which finds a 2-center of a tree
- On computing a longest path in a tree
- Locating tree-shaped facilities using the ordered median objective
- One-way and round-trip center location problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- The Round-Trip p-Center and Covering Problem on a Tree
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- The minimax multistop location problem on a tree
- Combinatorial Optimization with Rational Objective Functions
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Locating Centers on a Tree with Discontinuous Supply and Demand Regions
- R -Domination in Graphs
- Slowing down sorting networks to obtain faster sorting algorithms
- Finding kth paths and p-centers by generating and searching good data structures
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An Approach to Location Models Involving Sets as Existing Facilities
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
