Pages that link to "Item:Q884474"
From MaRDI portal
The following pages link to Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474):
Displaying 4 items.
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
