| Article ID: | iaor2006324 |
| Country: | Germany |
| Volume: | 11 |
| Issue: | 2 |
| Start Page Number: | 115 |
| End Page Number: | 133 |
| Publication Date: | Mar 2005 |
| Journal: | Journal of Heuristics |
| Authors: | Grout Vic |
| Keywords: | heuristics, internet |
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.