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 10 items.
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Pseudo-polynomial time algorithms for combinatorial food mixture packing problems (Q898726) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing (Q3586179) (← links)
- (Q4673409) (← links)
