How to Allocate Network Centers (1992)

Cached

Download Links

by Judit Bar-ilan , Guy Kortzars , David Peleg
Venue:J. Algorithms
Citations:65 - 2 self

Documents Related by Co-Citation

278 Clustering to minimize the maximum intercluster distance – T F Gonzalez - 1985
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
34 The Capacitated K-Center Problem – Samir Khuller, Yoram J. Sussmann - 1996
39 A simple heuristic for the p-center problem – M Dyer, A M Frieze - 1985
263 Approximation algorithms for facility location problems – David B. Shmoys, Eva Tardos, Karen Aardal - 1997
192 A best possible heuristic for the k-center problem – D S Hochbaum, D B Shmoys - 1985
37 A best possible approximation algorithm for the kā€“Center problem – D S Hochbaum, D B Shmoys - 1985
214 An algorithmic approach to network location problems, part II: p-medians – O Kariv, S Hakimi - 1979
32 approximations with minimum packing constraint violation – J-H Lin, J S Vitter - 1992
70 Approximation Algorithms for Geometric Median Problems – Jyh-Han Lin, Jeffrey Scott Vitter - 1992
92 The uncapacitated facility location problem – G P Cornuejols, G L Nemhauser, L A Wolsey - 1990
117 ON THE COMPLEXITY OF SOME COMMON GEOMETRIC LOCATION PROBLEMS – Nimrod Megiddo, Kenneth J. Supowit - 1984
86 A unified approach to approximation algorithms for bottleneck problems – D S Hochbaum, D B Shmoys - 1986
168 Optimal algorithms for approximate clustering – T Feder, D Greene - 1988
9 Data Collection for the Sloan Digital Sky Survey -- A Network-Flow Heuristic – Robert Lupton, F. Miller Maley, Neal Young - 1996
324 Primal-dual approximation algorithms for metric facility location and k-median problems – Vijay V. Vazirani - 1999
155 An Approximation Algorithm for the Generalized Assignment Problem – D B Shmoys, E Tardos - 1993
17 Quick k-median, k-center, and facility location for sparse graphs – M Thorup - 2001
76 e-approximations with minimum packing constraint violation – J-H Lin, J S Vitter - 1992