On improving connectivity of static ad-hoc networks by adding nodes

IFIP International Federation for Information Processing

Volumn 197, Issue , 2006, Pages 169-178

  Koskinen, Henri ^a   Karvo, Jouni ^a   Apilo, Olli ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

STATIC AD-HOC NETWORKS;

AD HOC NETWORKS;

EID: 33845524041     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-31173-4_19     Document Type: Article

References (4)

1. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345405, 1991.
2. D.-Z. Du and F. Hwang. An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio. In Proceedings of 31st Annual Symposium on Foundations of Computer Science, volume 1, pages 76-85, Oct. 1990.
3. M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing Steiner minimal trees. SIAM J. Appl. Math., 32(4):835-859, June 1977.
4. R. Sedgewick. Algorithms in C. Addison Wesley, 1990.