Efficient broadcast on random geometric graphs

Milan Bradonjic, Robert Elsasser, Tobias Friedrich, Thomas Sauerwald, A Stauffer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)
Original languageEnglish
Title of host publicationProceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
EditorsMoses Charikar
Place of PublicationPhiladelphia
PublisherSociety for Industrial and Applied Mathematics
Pages1412-1421
Publication statusPublished - 2010
EventSODA 2010: ACM-SIAM Symposium on Discrete Algorithms - Austin, Texas, USA United States
Duration: 17 Jan 201019 Jan 2010

Conference

ConferenceSODA 2010: ACM-SIAM Symposium on Discrete Algorithms
CountryUSA United States
CityAustin, Texas
Period17/01/1019/01/10

Cite this

Bradonjic, M., Elsasser, R., Friedrich, T., Sauerwald, T., & Stauffer, A. (2010). Efficient broadcast on random geometric graphs. In M. Charikar (Ed.), Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1412-1421). Society for Industrial and Applied Mathematics.