Pages that link to "Item:Q3595374"
From MaRDI portal
The following pages link to Approximating Precedence-Constrained Single Machine Scheduling by Coloring (Q3595374):
Displayed 5 items.
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)