On k-column sparse packing programs

DOI10.1007/978-3-642-13036-6_28MaRDI QIDQ3569831zbMATH OpenOpenAlexFDO

Authors N. Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan

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

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

Recommendations

• Solving packing integer programs via randomized rounding with alterations
• scientific article; zbMATH DE number 6850331
• Algorithms to approximate column-sparse packing problems
• \(\ell_1\)-sparsity approximation bounds for packing integer programs
• Approximability of Sparse Integer Programs

Cited in

(15)

• Approximating low-congestion routing and column-restricted packing problems
• Iterative packing for demand and hypergraph matching
• Solving packing integer programs via randomized rounding with alterations
• Generalized hypergraph matching via iterated packing and local ratio
• Approximability of Sparse Integer Programs
• scientific article; zbMATH DE number 6850331 (Why is no real title available?)
• Algorithms to approximate column-sparse packing problems
• Algorithms as mechanisms: the price of anarchy of relax and round
• Online Submodular Maximization Problem with Vector Packing Constraint.
• _1-sparsity approximation bounds for packing integer programs
• Approximability of sparse integer programs
• Distributed algorithms for covering, packing and maximum weighted matching
• When LP is the cure for your matching woes: improved bounds for stochastic matchings
• Column basis reduction and decomposable knapsack problems
• Coupled and \(k\)-sided placements: generalizing generalized assignment

This page was built for publication: On \(k\)-column sparse packing programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569831)