Pages that link to "Item:Q1790974"
From MaRDI portal
The following pages link to Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974):
Displaying 5 items.
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- New complexity results for shop scheduling problems with agreement graphs (Q2232609) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)
