Pages that link to "Item:Q1016523"

The following pages link to Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523):

Displaying 12 items.

• Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Single-machine scheduling with an external resource (Q2030286) (← 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)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm (Q6107781) (← links)