On k-Column Sparse Packing Programs

DOI10.1007/978-3-642-13036-6_28zbMath1285.90013OpenAlexW3124727707MaRDI QIDQ3569831

Nikhil Bansal, Aravind Srinivasan, Viswanath Nagarajan, Nitish Korula

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_28

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Related Items (8)

Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Coupled and \(k\)-sided placements: generalizing generalized assignment ⋮ Approximability of sparse integer programs ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Iterative Packing for Demand and Hypergraph Matching ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ Online Submodular Maximization Problem with Vector Packing Constraint.

This page was built for publication: On k-Column Sparse Packing Programs