Preemptive and non-preemptive generalized min sum set cover
From MaRDI portal
Publication:2904785
DOI10.4230/LIPIcs.STACS.2012.465zbMath1245.68250OpenAlexW2241182855MaRDI QIDQ2904785
Sungjin Im, Ruben van der Zwaan, M. I. Sviridenko
Publication date: 23 August 2012
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.465
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: Preemptive and non-preemptive generalized min sum set cover