Pages that link to "Item:Q2420656"

The following pages link to Better approximability results for min-max tree/cycle/path cover problems (Q2420656):

Displayed 8 items.

• A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) ‎ (← 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)
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) ‎ (← links)
• A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) ‎ (← links)
• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) ‎ (← links)
• Scheduling on a graph with release times (Q6204662) ‎ (← links)