Abstract
This paper considers variations of the minimum connected vertex cover problem to be found in the study of wireless network design. A simple, theoretic formulation is followed by a discussion of practical constraints. Two algorithms are given and results compared.
Disciplines
Computer Sciences
Recommended Citation
Grout,V. (2005)’Principles of Cost Minimisation in Wireless Networks’.Journal of Heuristics, 11(2), 115 -133
Digital Commons Citation
Grout, Vic, "Principles of Cost Minimisation in Wireless Networks" (2005). Computing. Paper 2.
http://epubs.glyndwr.ac.uk/cair/2
Comments
Original publication is available at www.springerlink.com