Pages that link to "Item:Q3569831"
From MaRDI portal
The following pages link to On k-Column Sparse Packing Programs (Q3569831):
Displaying 10 items.
- Approximability of sparse integer programs (Q634673) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- (Q4607900) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)