Approximation Algorithms for Min-Max Cycle Cover Problems

  title={Approximation Algorithms for Min-Max Cycle Cover Problems},
  author={Wenzheng Xu and W. Liang and X. Lin},
  journal={IEEE Transactions on Computers},
  • Wenzheng Xu, W. Liang, X. Lin
  • Published 2015
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 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
    37 Citations
    Improved approximation algorithms for some min-max and minimum cycle cover problems
    • 13
    Approximation Algorithms for the Min-Max Cycle Cover Problem With Neighborhoods
    • 1
    • PDF
    New LP relaxations for Minimum Cycle/Path/Tree Cover Problems
    • 1
    Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
    • 6
    • Highly Influenced
    • PDF
    New Approximation Algorithms for the Minimum Cycle Cover Problem
    • 8
    New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems
    • 1
    Approximation algorithms for distance constraint sweep coverage with base stations
    • 7
    Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
    • 1
    • Highly Influenced
    • PDF
    Better approximability results for min–max tree/cycle/path cover problems
    • 4
    Data Collection Maximization in Renewable Sensor Networks via Time-Slot Scheduling
    • 45
    • PDF


    Approximation results for a min-max location-routing problem
    • 18
    Approximations for minimum and min-max vehicle routing problems
    • 122
    • PDF
    Approximation algorithms for some routing problems
    • 335
    Approximating the k-traveling repairman problem with repairtimes
    • 33
    • PDF
    Solution of a Min-Max Vehicle Routing Problem
    • 113
    • PDF