The k-Allocation Problem and Its Variants

DOI10.1007/11970125_20zbMATH Open1129.90367OpenAlexW1531859515MaRDI QIDQ5443524

Dorit S. Hochbaum, Asaf Levin

Publication date: 21 February 2008

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11970125_20

zbMATH Keywords

Approximation algorithmsmaximum coverage problemallocation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Solving the \(k\)-cardinality assignment problem by transformation ⋮ The $k$ -Equal Problem

This page was built for publication: The k-Allocation Problem and Its Variants

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