A note on the generalized min-sum set cover problem

DOI10.1016/j.orl.2011.08.002zbMath1235.90131arXiv1107.2033OpenAlexW2963659614MaRDI QIDQ408432

David P. Williamson, Martin Skutella

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2033

zbMATH Keywords

approximation algorithms\(\alpha \)-point schedulingmin-sum set cover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Adaptive Submodular Ranking and Routing ⋮ Preemptive and non-preemptive generalized min sum set cover ⋮ Evaluation of monotone DNF formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating min sum set cover
• Multiple intents re-ranking
• List Scheduling in Order of α-Points on a Single Machine
• Algorithms – ESA 2005

This page was built for publication: A note on the generalized min-sum set cover problem