On-line Dominating Set Problems for Graphs
A dominating set of a graph G = (V, E) is a subset V’ of V such that for each vertex u ∈ V — V’ there is a vertex v ∈ V’ so that (u, v) ∈ E. The minimum dominating set problem is to find a set V’ of minimum cardinality, which is denoted by ø(G). It is well known that the minimum dominating set problem is NP-complete . In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.
KeywordsSteiner Tree Adjacent Vertex Performance Ratio Permutation Graph Charge Scheme
Unable to display preview. Download preview PDF.
- M.R. Carey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. (San Francisco, Freeman, 1979).Google Scholar
- R.M. Karp, U.V. Vazirani, and V.V. Vazirani, An optimal algorithm for on-line bipartite matching, Proceedings of the 22nd Annual ACM Symposium of Theory of Computing (1990) pp. 352–358.Google Scholar