A local facility location algorithm for sensor networks

Lecture Notes in Computer Science

Volumn 3560, Issue , 2005, Pages 368-375

  Krivitski, Denis ^a   Schuster, Assaf ^a   Wolff, Ran ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of Marylandw Baltimore County   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; SENSORS;

ROUTERLESS NETWORKS; SENSOR NETWORK ENVIRONMENT;

ALGORITHMS;

EID: 26444581773     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11502593_28     Document Type: Conference Paper

References (20)

1. Vijay Arya, Naveen Garg, Rohit Khandekar, Kamesh Munagala, and Vinayaka Pandit. Local search heuristic for k-median and facility location problems. In STOC, pages 21-29, 2001.
2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive network routing. Proc. 21st ACM STOC, May 1989.
3. Y. Birk, L. Liss, A. Schuster, and R. Wolff. A local algorithm for ad hoc majority voting via charge fusion. In DISC, 2004.
4. Moses Charikar and Sudipto Guha. Improved combinatorial algorithms for the facility location and k-median problems. In FOCS, pages 378-388, 1999.
5. Inderjit S. Dhillon and Dharmendra S. Modha. A data-clustering algorithm on distributed memory multiprocessors. In Large-Scale Parallel Data Mining, pages 245-260, 1999.
6. George Forman and Bin Zhang. Distributed data clustering can be efficient and exact. SIGKDD Explor. Newsl., 2(2):34-38, 2000.
7. D. Foti, D. Lipari, C. Pizzuti, and D. Talia. Scalable Parallel Clustering for Data Mining on Multicomputers. In IPDPS'00, Cancun, Mexico, May 2000.
8. Guha and Khuller. Greedy strikes back: Improved facility location algorithms. In SODA: ACM-SIAM), 1998.
9. P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388 - 404, 2000.
10. J.M. Jaffe and F.H. Moss. A responsive routing algorithm for computer networks. IEEE Transactions on Communications, pages 1758-1762, July 1982.
11. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems.
12. Kamal Jain and Vijay V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In FOCS, pages 2-13, 1999.
13. Jon Kleinberg, Christos Papadimitriou, and Prabhakar Raghavan. A microeconomic view of data mining. Data Mining and Knowledge Discovery, 1998.
14. Madhukar R. Korupolu, C. Greg Plaxton, and Rajmohan Rajaraman. Analysis of a local search heuristic for facility location problems. In Proc. ACM-SIAM, pages 1-10, 1998.
15. S. Kutten and B. Patt-Shamir. Time-adaptive self-stabilization. Proc. PODC, pages 149-158, August 1997.
16. S. Kutten and D. Peleg. Fault-local distributed mending. Proc. PODC, August 1995.
17. N. Linial. Locality in distributed graph algorithms. SIAM J. Comp., 21:193-201, 1992.
18. M. Naor and L. Stockmeyer. What can be computed locally? STOC, pages 184-193, 1993.
19. M. Sviridenko. An improved approximation algorithm for the metric uncapacitated facility location problem, 2002.
20. R. Wolff and A. Schuster. Association rule mining in peer-to-peer systems. In Proc. ICDM, Melbourne, Florida, 2003.