The following pages link to (Q4606268):
Displayed 4 items.
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)