Pages that link to "Item:Q2110360"
From MaRDI portal
The following pages link to Complexity and approximability of minimum path-collection exact covers (Q2110360):
Displaying 6 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs (Q2848201) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- (Q4788070) (← links)