Geographic quorum system approximations

Algorithmica (New York)

Volumn 41, Issue 4, 2005, Pages 233-244

  Carmi, Paz ^a   Dolev, Shlomi ^a   Har Peled, Sariel ^b   Katz, Matthew J ^a   Segal, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Clustering; Geometric optimization; Quorum system

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; OPTIMIZATION; SET THEORY;

APPROXIMATION ALGORITHMS; CLUSTERING; GEOMETRIC OPTIMIZATION; QUORUM SYSTEM;

APPROXIMATION THEORY;

EID: 13644254145     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1130-1     Document Type: Article

References (18)

1. P. K. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 31, pages 575-598. CRC Press, Boca Raton, FL, 1997.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. Assoc. Comput. Mach., 45(6):891-923, 1998.
3. S. N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In Proc. 11th Annu. ACM Symp. Comput. Geom., pages 152-161, 1995.
4. T. M. Chan. Approximate nearest neighbor queries revisited. Discrete Comput. Geom., 20:359-373, 1998.
5. S. Dolev, S. Gilbert, N. A. Lynch, A. Shvartsman, and J. L. Welch. Geoquorums: implementing atomic memory in ad hoc networks. In Proc. 17th Internat. Conf. Principles Distrib. Comput., pages 306-320. Volume 2848 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2003.
6. S. Dolev, E. Schiller, and J. Welch. Walk for self-stabilizing group communication in ad hoc networks. In Proc. 21st IEEE Symp. Reliable Distrib. Systems, pages 70-79, 2002.
7. A. Efrat, A. Itai, and M. J. Katz. Geometry helps in bottleneck matching and related problems. Algorithmica, 31(1):1-28, 2001.
8. S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
9. S. Har-Peled. Constructing approximate shortest path maps in three dimensions. SIAM J. Comput., 28(4): 1182-1197, 1999.
10. S. Har-Peled and S. Mazumdar. Fast algorithms for computing the smallest k-enclosing disc. In Proc. 11th Annu. European Symp. Algorithms, pages 278-288. Volume 2832 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2003.
11. M. P. Herlihy. Dynamic quorum adjustment for partitioned data. ACM Trans. Database Systems, 12(2):170-194, June 1987.
12. D. Malkhi and M. Reiter. Byzantine quorum systems. Distrib. Comput., 11(4):203-213, 1998.
13. M. Naor and A. Wool. The load, capacity, and availability of quorum systems. SIAM J. Comput., 27(2):423-447, 1998.
14. J. C. Navas and T. Imielinski. Geocast - geographic addressing and routing. In Proc. 3rd ACM/IEEE Internat. Conf. Mobile Computing and Networking, pages 66-76, 1997.
15. D. Peleg and A. Wool. The availability of quorum systems. Inform. and Comput., 123(2):210-223, 1995.
16. I. Stojmenovic and P. E. V. Pena. A scalable quorum based location update scheme for routing in ad hoc wireless networks. Technical Report TR-99-11, Computer Science, SITE, University of Ottawa, December 1999.
17. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, pages 359-370. Volume 555 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
18. D. B. West. Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs, NJ, 2001.