Titlebook: Handbook of Combinatorial Optimization; Ding-Zhu Du,Panos M. Pardalos Book 1998 Springer Science+Business Media New York 1998 algorithms.a

吞沒

Veneer

On-line Dominating Set Problems for Graphs,ating set problem is to find a set .’ of minimum cardinality, which is denoted by .(.). It is well known that the minimum dominating set problem is .-complete [9]. In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.