Pages that link to "Item:Q5383964"
From MaRDI portal
The following pages link to Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach (Q5383964):
Displaying 5 items.
- Minimizing the maximum flow time in batch scheduling (Q1709967) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)