Discrete mobile centers

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 188-196

  Gao, J ^a   Guibas, L J ^a   Hershberger, J ^a   Zhang, L ^a   Zhu, A ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED DATABASE SYSTEMS; HIERARCHICAL SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; SET THEORY; THEOREM PROVING;

KINETIC CLUSTERING;

DATA STRUCTURES;

EID: 0034826425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378666     Document Type: Conference Paper

References (23)

1. Lower bounds for kinetic planar subdivisions
2. Max-Min D-cluster formation in wireless ad hoc networks
3. Distributed clustering for ad hoc networks
4. Data structures for mobile data
5. Proximity problems on moving points
6. Mobile facility location
7. Routing in clustered multihop, mobile wireless networks with fading channel
8. A threshold of in n for approximating set cover
9. Optimal packing and covering in the plane are NP-complete
10. Multicluster, mobile, multimedia radio network
11. Approximation algorithms for connected dominating set
12. Kinetic data structures - A state of the art report
13. Bluetooth: Vision, goals, and architecture
14. Approximation schemes for covering and packing problems in image processing and VLSI
15. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
16. Mitigating routing misbehavior in mobile ad hoc networks
17. An architecture for mobile radio networks with dynamically changing topology using virtual subnets
18. On calculating connected dominating set for efficient routing in ad hoc wireless networks