Approximation Algorithms for Min-Max Cycle Cover Problems

@article{Xu2015ApproximationAF,
  title={Approximation Algorithms for Min-Max Cycle Cover Problems},
  author={Wenzheng Xu and Weifa Liang and Xiaola Lin},
  journal={IEEE Transactions on Computers},
  year={2015},
  volume={64},
  pages={600-613}
}
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… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Similar Papers

Loading similar papers…