Pages that link to "Item:Q5919633"
From MaRDI portal
The following pages link to New approximation algorithms for the minimum cycle cover problem (Q5919633):
Displaying 16 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← 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)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- An optimal strategy for the constrained cycle cover problem (Q2741265) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- Length-constrained cycle partition with an application to UAV routing* (Q5058406) (← links)
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph (Q5301401) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
