Approximability of Sparse Integer Programs
From MaRDI portal
Publication:3639237
DOI10.1007/978-3-642-04128-0_8zbMath1256.90027OpenAlexW2951496501MaRDI QIDQ3639237
No author found.
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_8
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (9)
Approximability of sparse integer programs ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Approximation schemes for deal splitting and covering integer programs with multiplicity constraints ⋮ Approximating integer programs with positive right-hand sides ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Iterative Packing for Demand and Hypergraph Matching ⋮ \(\ell_1\)-sparsity approximation bounds for packing integer programs ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
This page was built for publication: Approximability of Sparse Integer Programs
