Pages that link to "Item:Q4997320"
From MaRDI portal
The following pages link to A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320):
Displaying 3 items.
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)