On-line algorithms for the dominating set problem

DOI10.1016/S0020-0190(96)00191-3zbMath1337.68298OpenAlexW2031490900MaRDI QIDQ290186

Gow-Hsing King, Wen-Guey Tzeng

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00191-3

zbMATH Keywords

online algorithmsdominating set

Mathematics Subject Classification ID

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

Related Items (3)

Online dominating set ⋮ On the advice complexity of the online dominating set problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Finding a minimum independent dominating set in a permutation graph
• Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
• The greedy algorithm is optimal for on-line edge coloring
• Competitive algorithms for server problems

This page was built for publication: On-line algorithms for the dominating set problem