New approximation algorithms for the rooted budgeted cycle cover problem

DOI10.1016/j.tcs.2022.11.009OpenAlexW4309629630MaRDI QIDQ5925709

Peng Zhang, Jiangkun Li

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.009

zbMATH Keywords

combinatorial optimizationgraph algorithmapproximation algorithmwireless sensor networkbudgeted cycle cover

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Approximability of the minimum-weight \(k\)-size cycle cover problem
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• Min-max tree covers of graphs.
• Approximation results for a min-max location-routing problem
• The vehicle routing problem. Latest advances and new challenges.
• The Vehicle Routing Problem
• Approximation algorithms for distance constrained vehicle routing problems
• Approximation Algorithms for Min-Max Cycle Cover Problems
• Approximation results for min-max path cover problems in vehicle routing
• To fill or not to fill
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation to the Minimum Rooted Star Cover Problem
• Approximations for minimum and min-max vehicle routing problems
• New approximation algorithms for the rooted budgeted cycle cover problem
• New approximation algorithms for the minimum cycle cover problem

This page was built for publication: New approximation algorithms for the rooted budgeted cycle cover problem