Tight Approximation Algorithms for Maximum Separable Assignment Problems
From MaRDI portal
Publication:2884281
DOI10.1287/moor.1110.0499zbMath1238.68187OpenAlexW2054428995MaRDI QIDQ2884281
M. I. Sviridenko, Lisa K. Fleischer, Michel X. Goemans, Vahab S. Mirrokni
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/80849
Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (19)
The transportation problem with conflicts ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Approximability of Two Variants of Multiple Knapsack Problems ⋮ Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays ⋮ Resource time-sharing for IoT applications with deadlines ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems ⋮ A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function ⋮ Unnamed Item ⋮ Online interval scheduling with a bounded number of failures ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Improved approximation algorithms for box contact representations ⋮ Truthful mechanism design via correlated tree rounding ⋮ Unnamed Item ⋮ On the approximability of the two-phase knapsack problem ⋮ The Complexity of Contracts ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ Packing items into several bins facilitates approximating the separable assignment problem ⋮ Approximability of scheduling problems with resource consuming jobs
This page was built for publication: Tight Approximation Algorithms for Maximum Separable Assignment Problems
