Pages that link to "Item:Q344767"
From MaRDI portal
The following pages link to Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767):
Displaying 14 items.
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← 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)
- 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)
- 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)
- 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 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)
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems (Q6646740) (← links)
