论文信息 - NP-Completeness of ad hoc multicast routing problems - 字舞流文

NP-Completeness of ad hoc multicast routing problems

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

Guillaume Chelius | Eric Fleury

[1] Pierre Fraigniaud,et al. Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..

[2] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[3] Michel X. Goemans,et al. A catalog of steiner tree formulations , 1993, Networks.

[4] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.

[5] Stefan Voß,et al. Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Anis Laouiti,et al. Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .