Online Dominating Set

DOI10.4230/LIPIcs.SWAT.2016.21zbMath1378.68196arXiv1604.05172OpenAlexW2963055956MaRDI QIDQ5369523

Michal Kotrbčík, Kim S. Larsen, Lene Monrad Favrholdt, Stephan J. Eidenbenz, Joan. Boyar

Publication date: 17 October 2017

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

zbMATH Keywords

competitive analysisonline algorithmsdominating setconnected graphsgraph classes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Advice complexity bounds for online delayed \(\mathcal{F} \)-node-, \(H\)-node- and \(H\)-edge-deletion problems ⋮ Unnamed Item

This page was built for publication: Online Dominating Set