Center location problems on tree graphs with subtree-shaped customers
DOI10.1016/J.DAM.2007.11.022zbMATH Open1155.90418DBLPjournals/dam/PuertoTMP08OpenAlexW2159194866WikidataQ58217256 ScholiaQ58217256MaRDI QIDQ1005232FDOQ1005232
Arie Tamir, Dionisio Pérez-Brito, Juan A. Mesa, Justo Puerto
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
Recommendations
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- The location of central structures in trees
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- The \(p\)-center problem in tree networks revisited
- Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
Programming involving graphs or networks (90C35) Trees (05C05) Discrete location and assignment (90B80)
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- On computing a longest path in a tree
- Title not available (Why is that?)
- One-way and round-trip center location problems
- The Round-Trip p-Center and Covering Problem on a Tree
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Title not available (Why is that?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Title not available (Why is that?)
- 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
- Slowing down sorting networks to obtain faster sorting algorithms
- 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.
- Fast Algorithms for Finding Nearest Common Ancestors
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Title not available (Why is that?)
- An Approach to Location Models Involving Sets as Existing Facilities
- New Results on the Complexity of p-Centre Problems
- Locating tree-shaped facilities using the ordered median objective
- Title not available (Why is that?)
- R -Domination in Graphs
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- The minimax multistop location problem on a tree
- A self-stabilizing algorithm which finds a 2-center of a tree
- Locating Centers on a Tree with Discontinuous Supply and Demand Regions
Cited In (9)
- Almost self-centered graphs
- The location of central structures in trees
- Embeddings into almost self-centered graphs of given radius
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- A unifying location model on tree graphs based on submodularity property
- The connected \(p\)-center problem on block graphs with forbidden vertices
- The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
- On the planar piecewise quadratic 1-center problem
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
This page was built for publication: Center location problems on tree graphs with subtree-shaped customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005232)
