Approximation Algorithms for Min-Max Cycle Cover Problems
As a fundamental optimization problem, the vehicle routing problem has wide application backgrounds and has been paid lots of attentions in past decades. In this paper we study its applications in data gathering and wireless energy charging for wireless sensor networks, by devising improved approximation algorithms for it and its variants. The key ingredients in the algorithm design include exploiting the combinatorial properties of the problems and making use of tree decomposition and minimum...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Computers|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.