Fast clustering and minimum weight matching algorithms for very large mobile backbone wireless networks

International Journal of Foundations of Computer Science

Volumn 14, Issue 2, 2003, Pages 223-236

  Ferro, A ^a   Pigola, G ^a   Pulvirenti, A ^a   Shasha, D ^b  

^a UNIVERSITY OF CATANIA   (Italy)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Antipole Clustering; closest match; mobile base stations; Wireless Network

Indexed keywords

EID: 33847166046     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001698     Document Type: Article

References (17)

1. P. K. Agarwal, A. Efrat, and M. Sharir. Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and its Applications. SI AM Journal on Computing, 1999.
2. P. Agarwal and J. Erickson, Geometric Range Searching and its Relatives, J. Goodman B. Chazelle and R. Pollack, editors, Advances in Discrete and Computational Geometry. AMS Press, Providence, RI, 1998.
3. M. Atallah, A Matching Problem in the Plane, Journal of Computer and System Sciences, 31, pp. 63-70, 1985.
4. A. Borodin and R. El-Yaniv Online Computation and Competitive Analysis, Cambridge University Press, 1998.
5. D. Cantone, A. Ferro, T, Maugeri, A. Pulvirenti, and D. Shasha, Antipole Clustering to Support Range Search in Dynamic Metric Spaces with Applications to Multiple Sequence Alignment, Technical Report University of Catania, 2002.
6. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver, Combinatorial Optimization, Wiley-Interscience Series In Discrete Mathematics and Optimization, 1998.
7. H. Edelsbronner, L.J. Guibas, and J. Stolfi, Optimal Point Location in a Monotone Subdivision, SIAM Journal on Computing, 15(2):317-340, 1986.
8. A. Efrat and A. Itai, Improvements on Bottleneck Matching and Related Problems Using Geometry, Proceedings of the 12t/l ACM Symposium on Computational Geometry, pages 301-310, 1996.
9. A.Efrat, A.Itai, and M.J. Katz, Geometry helps in Bottleneck Matching and Related Problems, Algorithmica, 31(1), 1-28, 2001.
10. M. Gerla and Kai Shin Xu, Minuteman: Forward Projection of Unmanned Agents Using the Airborne Internet, IEEE Aerospace Conference, 2002.
11. S. Guha, R. Rastogi, and K. Shim, CURE: An Efficient Clustering Algorithm for Large Databases Proceedings of the ACM SIGMOD International Conference on Management of Data, 1998.
12. M. Junger and W. Pulleyblank, Geometric Duality and Combinatorial Optimization, Jahrbuck Uberblicke Mathematik, Vieweg, Brunschweig Wiesbaden 1993, pp. 1-24.
13. J. S. B. Mitchell and J. O'Rourke. Computational geometry column 42, Internat. Journal Computional Geometry and Applications, to appear. Also in SIGACT News 32(3):63-72 (2001), Issue 120.
14. F.P.Preparata and M.LShamos, Computational Geometry: An Introduction, Springer-Verlag, 1995.
15. M. Royer, C-K Toh, A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks, In IEEE Personal Communication Magazine, Vol. 6 46-55 Apri '99.
16. K. R. Varadarajan and Pankaj K. Agarwal. Approximation algorithms for bipartite and non-bipartite matching in the plane, Proceedings of the 10/l ACM-SIAM Symposium on Discrete Algorithms, 1999.
17. T. Zhang, R. Ramakrishnan, and M. Livny, BIRCH: an Efficient data clustering method for very large databases, Proceedings of the ACM SIGMOD International Conference on Management of Data, 1996.