Exploiting Structure: Location Problems on Trees and Treelike Graphs
From MaRDI portal
Publication:5506729
DOI10.1007/978-1-4419-7572-0_14zbMath1387.90112OpenAlexW1000459322MaRDI QIDQ5506729
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_14
Related Items
Cites Work
- On locating new facilities in a competitive environment
- Locating an absolute center on graphs that are almost trees
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- The obnoxious center problem on weighted cactus graphs.
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
- Efficient algorithms for center problems in cactus networks
- Median problems on wheels and cactus graphs
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Block-vertex duality and the one-median problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Finite Dominating Sets for Network Location Problems
- Locating a Point of Minimum Variance on Triangular Graphs
- Finding kth paths and p-centers by generating and searching good data structures
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- An Extended Theorem for Location on a Network
- Some Basic Definitions in Graph Theory
- Depth-First Search and Linear Graph Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
