On-line algorithms for the dominating set problem

DOI10.1016/S0020-0190(96)00191-3MaRDI QIDQ290186zbMATH OpenOpenAlexFDO

Authors 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

dominating setonline algorithms

Mathematics Subject Classification ID

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

Cites work

• Competitive algorithms for server problems
• Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
• Finding a minimum independent dominating set in a permutation graph
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The greedy algorithm is optimal for on-line edge coloring

Cited in

(6)

• Online dominating set
• On the advice complexity of the online dominating set problem
• Improved bounds for online dominating sets of trees
• Online dominating set and coloring
• Stable approximation algorithms for dominating set and independent set
• Online landmark replacement for out-of-sample dimensionality reduction methods

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

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