An improved deterministic algorithm for the online min-sum set cover problem

DOI10.1007/978-3-031-49815-2_4MaRDI QIDQ6574926zbMATH OpenFDO

Authors Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49815-2_4

zbMATH Keywords

competitive analysisderandomizationmin-sum set coveronline algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites work

• Approximating min sum set cover
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• On chromatic sums and distributed resource allocation
• On the power of randomization in on-line algorithms
• On-line learning and the metrical task system problem
• The multiplicative weights update method: a meta-algorithm and applications
• The weighted majority algorithm

Cited in

(1)

• Parameterized algorithms for minimum sum vertex cover

This page was built for publication: An improved deterministic algorithm for the online min-sum set cover problem

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