NP-Completeness of ad hoc multicast routing problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2005

NP-Completeness of ad hoc multicast routing problems

Abstract

In this research report, we study the algorithmic complexity of different broadcast and multicast ad hoc routing problems given a wireless medium.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5665.pdf (86.18 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070343 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070343 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More