On k-column sparse packing programs

DOI10.1007/978-3-642-13036-6_28zbMATH Open1285.90013OpenAlexW3124727707MaRDI QIDQ3569831FDOQ3569831

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

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

Mathematics Subject Classification ID

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

Cited In (15)

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

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)