Pages that link to "Item:Q2125230"
From MaRDI portal
The following pages link to Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230):
Displaying 4 items.
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)