On-line Dominating Set Problems for Graphs

Wen-Guey Tzeng ()
Additional contact information
Wen-Guey Tzeng: National Chiao Tung University, Department of Computer and Information Science

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1271-1288 from Springer

Abstract: Abstract 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 [9]. In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.

Keywords: Steiner Tree; Adjacent Vertex; Performance Ratio; Permutation Graph; Charge Scheme (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_19

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_19

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().