An improved algorithm for the p-center problem on interval graphs with unit lengths

Authors:
T. C. E. Cheng;Liying Kang;C. T. Ng
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong and Department of Mathematics, Shanghai University, Shanghai 200444, China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Operations Research
Year:
2007

Citing 8
Cited 6

A unified approach to approximation algorithms for bottleneck problems

Journal of the ACM (JACM)
Improved complexity bounds for center location problems on networks by using dynamic data structures

SIAM Journal on Discrete Mathematics
An overview of representative problems in location research

Management Science
Parallel Prefix Computation

Journal of the ACM (JACM)
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Scheduling with conflicts on bipartite and interval graphs

Journal of Scheduling - Special issue: On-line scheduling
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Structured p-facility location problems on the line solvable in polynomial time

Operations Research Letters

A memetic genetic algorithm for the vertex p-center problem

Evolutionary Computation
The p-maxian problem on interval graphs

Discrete Applied Mathematics
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs

Computational Geometry: Theory and Applications
Solving the constrained p-center problem using heuristic algorithms

Applied Soft Computing
The connected p-center problem on block graphs with forbidden vertices

Theoretical Computer Science
Backup 2-center on interval graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider this problem by modelling the network as an interval graph whose edges all have unit lengths. We present an O(n) time algorithm for the problem under the assumption that the endpoints of the intervals are sorted, which improves on the existing best algorithm for the problem that has a run time of O(pn).