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 9 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Minimal cut cover of a graph with an application to the testing of electronic boards (Q1195870) (← 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)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Min-Max Graph Partitioning and Small Set Expansion (Q5494941) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- The heterogeneous rooted tree cover problem (Q6591623) (← links)