Preemptive and non-preemptive generalized min sum set cover

DOI10.4230/LIPICS.STACS.2012.465zbMATH Open1245.68250OpenAlexW2241182855MaRDI QIDQ2904785FDOQ2904785

Authors: Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan 

Publication date: 23 August 2012

Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.465

Recommendations

• Preemptive and non-preemptive generalized min sum set cover
• scientific article; zbMATH DE number 1947050
• The geometry of scheduling
• Approximating min sum set cover
• A note on the generalized min-sum set cover problem

zbMATH Keywords

approximationpreemptionset coverlatencyaverage cover time

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cited In (3)

• Precedence-Constrained Min Sum Set Cover
• A note on the generalized min-sum set cover problem
• Preemptive and non-preemptive generalized min sum set cover

This page was built for publication: Preemptive and non-preemptive generalized min sum set cover

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