Pages that link to "Item:Q1751107"
From MaRDI portal
The following pages link to Min-max cover of a graph with a small number of parts (Q1751107):
Displaying 4 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- An overview of graph covering and partitioning (Q2142633) (← 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)
