Abstract
We consider several variants of a basic resource replication problem in this paper, and propose new approximation results for them. These problems are of fundamental interest in the areas of P2P networks, sensor networks and ad hoc networks, where optimal placement of replicas is the main bottleneck on performance. We observe that the threshold graph technique, which has been applied to several k-center type problems, yields simple and efficient approximation algorithms for resource replication problems. Our results range from positive (efficient, small constant factor, approximation algorithms) to extremely negative (impossibility of existence of any algorithm with non-trivial approximation guarantee, i.e., with positive approximation ratio) for different versions of the problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baev, I.D., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: SODA, pp. 661–670 (2001)
Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput. 38(4), 1411–1429 (2008)
Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385–415 (1993)
Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: SODA, pp. 324–333 (2006)
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642–651 (2001)
Edmonds, J.: Paths, trees, and flowers. In: Gessel, I., Rota, G.-C. (eds.) Classic Papers in Combinatorics, Modern Birkhuser Classics, pp. 361–379. Birkhuser, Boston (1987)
Edmonds, J., Fulkerson, D.R.: Bottleneck extrema. Journal of Combinatorial Theory 8(3), 299–306 (1970)
Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29(3), 410–421 (2001)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. ACM Transactions on Algorithms 5(4) (2009)
Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)
Guha, S., Munagala, K.: Improved algorithms for the data placement problem. In: SODA, pp. 106–107 (2002)
Gupta, A., Krishnaswamy, R., Kumar, A., Segev, D.: Scheduling with Outliers. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 149–162. Springer, Heidelberg (2009)
Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research 10(2), 180–184 (1985)
Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3), 533–550 (1986)
Khuller, S., Sussmann, Y.J.: The capacitated k-center problem. SIAM J. Discrete Math. 13(3), 403–418 (2000)
Ko, B.-J., Rubenstein, D.: Distributed, self-stabilizing placement of replicated resources in emerging networks. In: ICNP, pp. 6–15 (2003)
Ko, B.-J., Rubenstein, D.: Distributed server replication in large scale networks. In: NOSSDAV, pp. 127–132 (2004)
Korupolu, M.R., Greg Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: SODA, pp. 1–10 (1998)
Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: SODA, pp. 1117–1130 (2011)
Meyerson, A., Munagala, K., Plotkin, S.A.: Web caching using access statistics. In: SODA, pp. 354–363 (2001)
Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: ICS, pp. 342–357 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khuller, S., Saha, B., Sarpatwar, K.K. (2012). New Approximation Results for Resource Replication Problems. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2012 2012. Lecture Notes in Computer Science, vol 7408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32512-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-32512-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32511-3
Online ISBN: 978-3-642-32512-0
eBook Packages: Computer ScienceComputer Science (R0)