Online disjoint set cover without prior knowledge

DOI10.4230/LIPICS.ESA.2019.44MaRDI QIDQ5075787zbMATH OpenFDO

Authors Yuval Emek, Adam Goldbraikh, E. Kantor

Publication date 11 May 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2019.44

zbMATH Keywords

competitive analysiscompetitiveness with high probabilitydisjoint set coveronline algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• The online set cover problem
• The online set cover problem
• Online and dynamic algorithms for set cover
• Online set multicover algorithms for dynamic D2D communications
• scientific article; zbMATH DE number 6696496

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Semi-streaming set cover
• Sketching cuts in graphs and hypergraphs
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• The online set cover problem
• The probabilistic method

Cited in

(2)

• Online disjoint set covers: randomization is not necessary
• Online disjoint spanning trees and polymatroid bases

This page was built for publication: Online disjoint set cover without prior knowledge

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