New approximation algorithms for the rooted budgeted cycle cover problem
From MaRDI portal
Publication:5918725
DOI10.1007/978-3-030-92681-6_14OpenAlexW4205805254MaRDI QIDQ5918725
Publication date: 29 June 2022
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_14
combinatorial optimizationgraph algorithmapproximation algorithmwireless sensor networkbudgeted cycle cover
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
An overview of graph covering and partitioning ⋮ New approximation algorithms for the rooted budgeted cycle cover problem
Uses Software
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
- 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
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems
- 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 minimum cycle cover problem
This page was built for publication: New approximation algorithms for the rooted budgeted cycle cover problem
