Skip to Main content Skip to Navigation
Reports

NP-Completeness of ad hoc multicast routing problems

Guillaume Chelius 1 Eric Fleury
1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : In this research report, we study the algorithmic complexity of different broadcast and multicast ad hoc routing problems given a wireless medium.
Document type :
Reports
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070343
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:10:58 PM
Last modification on : Wednesday, July 8, 2020 - 12:42:10 PM
Long-term archiving on: : Sunday, April 4, 2010 - 7:54:53 PM

Identifiers

  • HAL Id : inria-00070343, version 1

Collections

Citation

Guillaume Chelius, Eric Fleury. NP-Completeness of ad hoc multicast routing problems. RR-5665, INRIA. 2005, pp.8. ⟨inria-00070343⟩

Share

Metrics

Record views

187

Files downloads

445