Online dominating set
type: Item
instance of: scholarly article
title: Online dominating set
zbMATH Open document ID: 1421.68239
author: Stephan J. Eidenbenz
author: Michal Kotrbčík
author: Kim S. Larsen
author: Joan Boyar
author: Lene M. Favrholdt
published in: Algorithmica
publication date: 2019-05-07T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7051771
zbMATH Keywords: online algorithms
zbMATH Keywords: dominating set
zbMATH Keywords: competitive analysis
zbMATH Keywords: irrevocability
MaRDI profile type: Publication
full work available at URL: s00453-018-0519-1
OpenAlex ID: W2893780080
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Q3277097
cites work: Online Colored Bin Packing
cites work: Q4223058
cites work: The seat reservation problem
cites work: Two-Bounded-Space Bin Packing Revisited
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Connected dominating set. Theory and applications
cites work: A threshold of ln n for approximating set cover
cites work: Q4368728
cites work: Total Domination in Graphs
cites work: Competitive snoopy caching
cites work: Reducibility among Combinatorial Problems
cites work: On-line algorithms for the dominating set problem
cites work: Q5799732
cites work: Q5581642
cites work: Q3291034
Wikidata QID: Q129189893
DOI: 10.1007/S00453-018-0519-1
description: scientific article; zbMATH DE number 7051771