Improved complexity bounds for location problems on the real line

In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.

[1]  M. Klawe.  A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming , 1989 .

[2]  Robert E. Wilber.  The Concave Least-Weight Subsequence Problem Revisited , 1988, J. Algorithms.

[3]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[4]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[5]  Timothy J. Lowe,et al.  Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products , 1990, Oper. Res..

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  T. Lowe,et al.  A dynamic programming algorithm for covering problems with (greedy) totally balanced constraint matrices , 1986 .

[8]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[9]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  Wen-Lian Hsu,et al.  The distance-domination numbers of trees , 1982, Oper. Res. Lett..

[11]  Zvi Galil,et al.  A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming , 1990, Inf. Process. Lett..

[12]  S. Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

[13]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[14]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[15]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[16]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .