New approximation algorithms for the rooted budgeted cycle cover problem

DOI10.1016/J.TCS.2022.11.009MaRDI QIDQ5925709zbMATH OpenOpenAlexFDO

Authors Jiangkun Li, Peng Zhang

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

approximation algorithmbudgeted cycle covercombinatorial optimizationgraph algorithmwireless sensor network

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• New approximation algorithms for the rooted budgeted cycle cover problem
• Improved approximation algorithms for min-max and minimum vehicle routing problems
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• Constant-factor approximations for cycle cover problems
• STACS 2005

Cites work

• Approximability of the minimum-weight \(k\)-size cycle cover problem
• Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation algorithms for distance constrained vehicle routing problems
• Approximation Algorithms for Min-Max Cycle Cover Problems
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation results for a min-max location-routing problem
• Approximation results for min-max path cover problems in vehicle routing
• Approximation to the Minimum Rooted Star Cover Problem
• Approximations for minimum and min-max vehicle routing problems
• scientific article; zbMATH DE number 3775225 (Why is no real title available?)
• Improved algorithms for orienteering and related problems
• 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.
• New approximation algorithms for the minimum cycle cover problem
• New approximation algorithms for the rooted budgeted cycle cover problem
• The vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• To fill or not to fill, the gas station problem

Cited in

(4)

• New approximation algorithms for the rooted budgeted cycle cover problem
• Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
• Approximation algorithms for solving the trip-constrained vehicle routing cover problems
• Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925709)