Approximating node-weighted Steiner subgraphs for multicast communication in wireless networks
We are motivated by the problem of computing multicast routing structures in wireless ad-hoc networks modelled by special classes of graphs including unit disk graphs, quasi-unit disk graphs and (λ + 1)-claw-free graphs. Multicast communication can be established by a tree known as Steiner tree. Wir...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Leicester
2012
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551943 |