The following pages link to Vertex cover meets scheduling (Q270025):
Displaying 3 items.
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover (Q4639895) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
