Pages that link to "Item:Q974986"
From MaRDI portal
The following pages link to Approximation hardness of min-max tree covers (Q974986):
Displaying 14 items.
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- (Q6084420) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
