-
1
-
-
0002928519
-
New online algorithms for the page replication problem
-
S. Albers and H. Koga. New online algorithms for the page replication problem. J. of Algorithms, 27(1):75-96, 1998.
-
(1998)
J. of Algorithms
, vol.27
, Issue.1
, pp. 75-96
-
-
Albers, S.1
Koga, H.2
-
3
-
-
0030393774
-
Probabilistic approximations of metric spaces and its algorithmic applications
-
Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. Proc. of FOCS '96, pp. 184-193, 1996.
-
(1996)
Proc. of FOCS '96
, pp. 184-193
-
-
Bartal, Y.1
-
4
-
-
0029539433
-
Competitive algorithms for distributed data management
-
Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. J. of Computer and System Sciences, 51(3):341-358, 1995.
-
(1995)
J. of Computer and System Sciences
, vol.51
, Issue.3
, pp. 341-358
-
-
Bartal, Y.1
Fiat, A.2
Rabani, Y.3
-
6
-
-
0030675156
-
Incremental clustering and dynamic information retrieval
-
M. Charicar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. Proc. of STOC '97, pages 626-635, 1997.
-
(1997)
Proc. of STOC '97
, pp. 626-635
-
-
Charicar, M.1
Chekuri, C.2
Feder, T.3
Motwani, R.4
-
7
-
-
0034819428
-
Clustering to minimize the sum of cluster diameters
-
M. Charicar and R. Panigrahy. Clustering to minimize the sum of cluster diameters. Proc. of STOC '01, pages 1-10, 2001.
-
(2001)
Proc. of STOC '01
, pp. 1-10
-
-
Charicar, M.1
Panigrahy, R.2
-
10
-
-
0032280078
-
Greedy strikes back: Improved facility location algorithms
-
S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Proc. of SODA '98, pp. 649-657, 1998.
-
(1998)
Proc. of SODA '98
, pp. 649-657
-
-
Guha, S.1
Khuller, S.2
-
12
-
-
0000682161
-
Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
-
K. Jain and V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. of the ACM, 48(2):274-296, 2001.
-
(2001)
J. of the ACM
, vol.48
, Issue.2
, pp. 274-296
-
-
Jain, K.1
Vazirani, V.2
-
13
-
-
0032265935
-
Competitive online algorithms for distributed data management
-
C. Lund, N. Reingold, J. Westbrook, and D.C.K. Yan. Competitive online algorithms for distributed data management. SIAM J. on Computing, 28(3):1086-1111, 1999.
-
(1999)
SIAM J. on Computing
, vol.28
, Issue.3
, pp. 1086-1111
-
-
Lund, C.1
Reingold, N.2
Westbrook, J.3
Yan, D.C.K.4
-
14
-
-
84957042819
-
Improved approximation algorithms for metric facility location problems
-
M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. Proc. of APPROX '02, LNCS 2462, pp. 229-242, 2002.
-
(2002)
Proc. of APPROX '02, LNCS 2462
, pp. 229-242
-
-
Mahdian, M.1
Ye, Y.2
Zhang, J.3
-
16
-
-
0035187014
-
Online facility location
-
A. Meyerson. Online facility location. Proc. of FOCS '01, pp. 426-431, 2001.
-
(2001)
Proc. of FOCS '01
, pp. 426-431
-
-
Meyerson, A.1
-
17
-
-
84937441113
-
Approximation algorithms for facility location problems
-
D. Shmoys. Approximation algorithms for facility location problems. Proc. of APPROX '00, LNCS 1913, pp. 27-33, 2000.
-
(2000)
Proc. of APPROX '00, LNCS 1913
, pp. 27-33
-
-
Shmoys, D.1
-
18
-
-
0030645561
-
Approximation algorithms for facility location problems
-
D. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. Proc. of STOC '97, pp. 265-274, 1997.
-
(1997)
Proc. of STOC '97
, pp. 265-274
-
-
Shmoys, D.1
Tardos, E.2
Aardal, K.3
|