_1-sparsity approximation bounds for packing integer programs

DOI10.1007/978-3-030-17953-3_10MaRDI QIDQ5919383zbMATH OpenOpenAlexFDO

Authors Chandra Chekuri, Kent Quanrud, Manuel Torres

Publication date 6 February 2020

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

Full work available at URL https://doi.org/10.1007/978-3-030-17953-3_10

zbMATH Keywords

\(\ell_1\)-column sparsityapproximation algorithmspacking integer programs

Mathematics Subject Classification ID

Boolean programming (90C09) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• \(\ell_1\)-sparsity approximation bounds for packing integer programs
• On k-column sparse packing programs
• Approximability of Sparse Integer Programs
• Solving packing integer programs via randomized rounding with alterations
• Approximability of sparse integer programs

Cited in

(4)

• Approximation of set multi-cover via hypergraph matching
• Solving packing integer programs via randomized rounding with alterations
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
• \(\ell_1\)-sparsity approximation bounds for packing integer programs

This page was built for publication: \(\ell_1\)-sparsity approximation bounds for packing integer programs

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