Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 1 (3) , 377-396
- https://doi.org/10.1137/0401038
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Constructing Belts in Two-Dimensional Arrangements with ApplicationsSIAM Journal on Computing, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Location of Multiple Obnoxious FacilitiesTransportation Science, 1985
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Convex Location Problems on Tree NetworksOperations Research, 1976
- Optimal Center Location in Simple NetworksTransportation Science, 1971