A note on the generalized min-sum set cover problem

DOI10.1016/J.ORL.2011.08.002zbMATH Open1235.90131arXiv1107.2033OpenAlexW2963659614MaRDI QIDQ408432FDOQ408432

Authors: David P. Williamson, Martin Skutella 

Publication date: 5 April 2012

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

Abstract: In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin. Bansal, Gupta, and Krishnaswamy give a 485-approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from $alpha$-point scheduling to obtain our improvements.

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

Recommendations

• scientific article; zbMATH DE number 1947050
• A Tight Analysis of the Greedy Algorithm for Set Cover
• A constant factor approximation algorithm for generalized MIN-sum set cover
• Approximating min sum set cover
• Preemptive and non-preemptive generalized min sum set cover

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)

Cites Work

• Title not available (Why is that?)
• Approximating min sum set cover
• Multiple intents re-ranking
• A constant factor approximation algorithm for generalized MIN-sum set cover
• List Scheduling in Order of α-Points on a Single Machine
• Algorithms – ESA 2005

Cited In (11)

• Preemptive and non-preemptive generalized min sum set cover
• Title not available (Why is that?)
• Preemptive and non-preemptive generalized min sum set cover
• Improved approximations for min sum vertex cover and generalized min sum set cover
• A constant factor approximation algorithm for generalized MIN-sum set cover
• Approximating min sum set cover
• Hardness and approximation of submodular minimum linear ordering problems
• Adaptive submodular ranking and routing
• A note on the clustered set covering problem
• On min sum vertex cover and generalized min sum set cover
• Evaluation of monotone DNF formulas

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

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