Pages that link to "Item:Q2982336"
From MaRDI portal
The following pages link to Approximation Algorithms for Min-Max Cycle Cover Problems (Q2982336):
Displaying 26 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- On the Cycle Augmentation Problem: hardness and approximation algorithms (Q2193089) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Covering tours and cycle covers with turn costs: hardness and approximation (Q2294052) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- An optimal strategy for the constrained cycle cover problem (Q2741265) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
- On Approximating Restricted Cycle Covers (Q3614154) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
- Drone-based hybrid charging for multiple sensors: a distributionally robust optimization approach (Q6568411) (← links)
- The heterogeneous rooted tree cover problem (Q6591623) (← links)
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems (Q6646740) (← links)
