An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
From MaRDI portal
Publication:868984
DOI10.1016/j.cor.2005.08.013zbMath1112.05097OpenAlexW2032392714MaRDI QIDQ868984
Publication date: 26 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.08.013
Related Items (5)
The \(p\)-Maxian problem on interval graphs ⋮ The connected \(p\)-center problem on block graphs with forbidden vertices ⋮ Backup 2-center on interval graphs ⋮ On some inverse 1-center location problems ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Structured \(p\)-facility location problems on the line solvable in polynomial time
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- Scheduling with conflicts on bipartite and interval graphs
- A simple linear-time algorithm for computing the center of an interval graph
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- An Overview of Representative Problems in Location Research
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Parallel Prefix Computation
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
