Professional Documents
Culture Documents
Soda01 Outlier
Soda01 Outlier
Proof. Lemmas 5.4 and 5.3 imply that C + 3F ≤ Theorem 5.3. Let C be the assignment cost of the
3OP T 0 . In addition to the facility costs included in solution returned by the algorithm, P be the total penalty
F , the cost of the final robust facility location solution for the vertices selected as outliers and OP T be the cost
may include the cost f1 of the guessed most expensive of the optimal solution. Then,
facility (recall that its cost is set to zero in the modified (5.46) C + 4P ≤ 4OP T
instance) as well as the cost f2 of the facility that got
paid for at the termination of the primal dual algorithm. 5.5 Robust k-median. The gap example in Ap-
Now f1 = f 0 and f2 ≤ f 0 . The cost of the final solution pendix A shows that we cannot expect to obtain a con-
is at most C + F + f1 + f2 ≤ 3OP T 0 + 2f 0 ≤ 3OP T . stant factor guarantee for the robust k-median problem
by using the linear relaxation LP4 (4.31) - (4.36) as a [2] S. Arora, P. Raghavan, and S. Rao. Approximation
lower bound. However, we can get a bi-criteria approx- schemes for Euclidean k-median and related problems.
imation guarantee using the previous result. We take a In Proc. 30th Annu. ACM Sympos. Theory Comput.,
robust k-median instance, set penalties of vertices ap- pages 106–113, 1998.
propriately and use the solution returned by running [3] M. L. Balinski, “On finding integer solutions to linear
programs”, Proc. of the IBM Scientific Computing
the k-median with penalties algorithm on this instance.
Symposium on Combinatorial Problems, pages 225–
The penalties are chosen as follows: Suppose we know
248, (1966).
the value C ∗ of the optimal solution to the robust k- [4] M. Charikar and S. Guha. Improved combinatorial al-
median problem with at most ` outliers. We set the gorithms for the facility location and k-median prob-
penalties of vertices to be C ∗ /γ` (γ is a tradeoff param- lems. In Proc. 40th Annu. IEEE Sympos. Found. Com-
eter that we can set). Since we do not know the exact put. Sci., pages 378–388, 1999.
value C ∗ of the optimal solution, we guess C ∗ to within [5] M. Charikar, S. Guha, E. Tardos, and D. Shmoys.
1 + . A constant factor approximation algorithm for the k-
median problem. In Proc. 31st Annu. ACM Sympos.
Theorem 5.4. The algorithm returns a solution to the Theory Comput., pages 1–10, 1999.
robust k-median problem with number of outliers at most [6] F. Chudak. Improved approximation algorithms for
(1 + γ) times the optimal solution and cost at most uncapacitated facility location. In Integer program-
4(1 + 1/γ) times the cost of the optimal solution (within ming and combinatorial optimization, pages 180–194,
(1 + ) factors). 1998.
[7] G. Cornuejols, G. L. Nemhauser and L. A. Wolsey,
Proof. For ease of presentation, we will first assume “The uncapacitated facility location problem”, Dis-
that the penalties are set to exactly C ∗ /γ`, where C ∗ is crete Location Theory (ed: Mirchandani and Francis),
the cost of the optimal solution to the robust k-median pages 119–171, (1990).
problem with ` outliers. For the instance of k-median [8] T. Feder and D. H. Greene. Optimal algorithms for
approximate clustering. In Proc. 20th STOC, pages
with penalties, the value OP T of the optimal solution
434–444, 1988.
is at most
[9] U. Feige. A threshold of ln n for approximating set
C∗ 1 cover. J. ACM, 45(4):634–652, 1998.
OP T ≤ C ∗ + ` · = C∗ 1 + .
γ` γ [10] M. X. Goemans and D. P. Williamson. A general ap-
proximation technique for constrained forest problems.
Suppose the algorithm for the k-median problem with SIAM Journal on Computing, 24:296-317, 1995.
penalties returns a solution of cost C with `0 outliers. [11] D. Bienstock, M. Goemans, D. Simchi-Levi and D.
Then Williamson. A Note on the Prize Collecting Traveling
Salesman Problem. Mathematical Programming, 59,
C∗ 1
C + 4`0 ≤ 4C ∗ 1 + pages 413–420 (1993).
γ` γ [12] M. Dyer and A. M. Frieze. A simple heuristic for the
1 p-center problem. Operations Research Letters, 3:285–
C ≤ 4C ∗ 1 + 288, 1985.
γ
0
[13] Sudipto Guha and Samir Khuller. Greedy strikes back:
` ≤ `(1 + γ) Improved facility location algorithms. In Proc of the
9th Annual ACM-SIAM Symp. on Discrete Algorithms,
Since we guess the value of C ∗ to within a (1 + ) factor, pages 649–657, 1998.
the above guarantees on C and ` hold to within (1 + ) [14] Martha Hamilton. Loud and clear, a silent e. The
factors. Washington Post, April 23 2000.
[15] D. S. Hochbaum, “Heuristics for the fixed cost median
Acknowledgments problem”, Mathematical Programming, 22: 148–162,
We would like to thank Sudipto Guha for useful discus- (1982).
sions. In particular, Sudipto fixed a bug in the lower [16] D. Hochbaum. Approximation Algorithms for NP-hard
problems. PWS Publishing, 1995.
bound proof for the robust k-center problem.
[17] D. S. Hochbaum and D. B. Shmoys. A unified approach
to approximation algorithms for scheduling problems:
References Practical and theoretical results. J. ACM, 33:533–550,
1986.
[1] S. Arora. Polynomial time approximation schemes for [18] A. Jain and R. Dubes. Algorithms for Clustering Data.
Euclidean TSP and other geometric problems. In Proc. Prentice Hall, Englewood Cliffs, NJ, 1988.
37th Annu. IEEE Sympos. Found. Comput. Sci., pages [19] K. Jain and V. Vazirani. Primal-dual approximation
2–11, 1996. algorithms for metric facility location and k-median
problems. In Proc. 40th Annu. IEEE Sympos. Found. cost of this solution is 0 and the number of outliers is n.
Comput. Sci., pages 2–13, 1999. The second solution S2 consists of centers at x and z.
[20] S. Khuller, A. Moss, and J. Naor. The budgeted The vertices at y are connected to the center at x. The
maximum coverage problem. IPL, 70(1):39–45, 1999. cost of this solution is 2n and the number of outliers is 0.
[21] M. Korupolu, C. G. Plaxton and R. Rajaraman, “Anal- Consider the fractional solution S = (1 − n1 )S1 + n1 S2 .
ysis of a local search heuristic for facility location prob-
This is a feasible solution to LP4 with the number of
lems”, 9th ACM-SIAM Annual Symposium on Discrete
outliers ` = n − 1 and cost 2. However the optimal cost
Algorithms, pages 1–10, (1998).
[22] A. A. Kuehn and M. J. Hamburger, “A heuristic pro- of an integral solution with at most n−1 outliers is n+1.
gram for locating warehouses”, Management Science, (For example, this can be achieved by placing centers
9:643–666, (1963). at x and z. n + 1 of the vertices at y are connected to
[23] J.-H. Lin and J. S. Vitter, “Approximation algorithms the center at x and n − 1 of them are selected to be
for geometric median problems”, Information Process- outliers). This implies that the integrality gap of LP4
ing Letters, 44:245–249, (1992). is at least (n + 1)/2.
[24] A. S. Manne, “Plant location under economies-of-
scale-decentralization and computation”, Management
Science, 11:213–235, (1964).
[25] J. Matoušek, D. Mount, and N. Netanyahu. Efficient
randomized algorithms for the repeated median line
estimator. In Proc. 4th SODA, pages 74–82, 1993.
[26] D. Mount, N. Netanyahu, and J. LeMoigne. Efficient
algorithms for robust point pattern matching and
applications to image registration. In Proc. of the
CESDIS Image Registration Workshop, pages 247–256,
1997.
[27] D. Mount, N. Netanyahu, K. Romanik, R. Silverman,
and A. Yu. A practical approximation algorithm for
the lms line estimator. In Proc. 8th SODA, pages 473–
482, 1997.
[28] G. Nemhauser and L. Wolsey. Integer and Combina-
torial Optimization. John Wiley and Sons, New York
1990.
[29] J. Plesnik. A heuristic for the p-center problem in
graphs. Discrete Applied Mathematics, 17:263–268,
1987.
[30] P. J. Rousseeuw and A. M. Leroy. Robust Regression
and Outlier Detection. Wiley, New York, 1987.
[31] D. Shmoys, E. Tardos, and K. Aardal. Approximation
algorithms for facility location problems. In Proc. 29th
Annu. ACM Sympos. Theory Comput., pages 265–274,
1997.
[32] J. F. Stollsteimer, “A working model for plant numbers
and locations”, J. Farm Econom., 45: 631–645, (1963).
Appendix