Optimization problems in communication networks
We study four problems arising in the area of communication networks. The minimum-weight dominating set problem in unit disk graphs asks, for a given set D of weighted unit disks, to find a minimum-weight subset D' ⊆ D such that the disks D' intersect all disks D. The problem is NP-hard...
| Main Author: | |
|---|---|
| Published: |
University of Leicester
2006
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.436662 |