Scheduling with Precedence Constraints of Low Fractional Dimension
From MaRDI portal
(Redirected from Publication:5429263)
Recommendations
- On the approximability of single-machine scheduling with precedence constraints
- On the approximability of average completion time scheduling under precedence constraints.
- scientific article; zbMATH DE number 1754642
- Approximating Precedence-Constrained Single Machine Scheduling by Coloring
- scientific article; zbMATH DE number 5605136
Cited in
(12)- Single machine precedence constrained scheduling is a Vertex cover problem
- On the approximability of average completion time scheduling under precedence constraints.
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- On the approximability of single-machine scheduling with precedence constraints
- Vertex cover in graphs with locally few colors
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Single Machine Scheduling with Precedence Constraints of Dimension 2
- scientific article; zbMATH DE number 5605136 (Why is no real title available?)
- Approximating Precedence-Constrained Single Machine Scheduling by Coloring
- scientific article; zbMATH DE number 1754642 (Why is no real title available?)
- Quasi-PTAS for scheduling with precedences using LP hierarchies
This page was built for publication: Scheduling with Precedence Constraints of Low Fractional Dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429263)