The k-Allocation Problem and Its Variants

DOI10.1007/11970125_20MaRDI QIDQ5443524zbMATH OpenOpenAlexFDO

Authors Dorit S. Hochbaum, Asaf Levin

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

allocation problemApproximation algorithmsmaximum coverage problem

Mathematics Subject Classification ID

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

Recommendations

• How to allocate review tasks for robust ranking
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
• An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem
• A note on a new variant of Murty's ranking assignments algorithm
• Assigning papers to referees

Cited in

(5)

• Solving the k-cardinality assignment problem by transformation
• The $k$ -Equal Problem
• scientific article; zbMATH DE number 7366679 (Why is no real title available?)
• How to allocate review tasks for robust ranking
• Creating a consensus ranking of proposals from reviewers' partial ordinal rankings

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)