Connected Dominating Set: Theory and Applications

Front Cover
Springer Science & Business Media, Oct 26, 2012 - Business & Economics - 206 pages
The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Theory and Applications Chapter 1 Introduction
1
Theory and Applications Chapter 2 CDS in General Graph
11
Theory and Applications Chapter 3 CDS in Unit Disk Graph
35
Theory and Applications Chapter 4 CDS in Unit Ball Graphs and Growth Bounded Graphs
63
Theory and Applications Chapter 5 Weighted CDS in Unit Disk Graph
76
Theory and Applications Chapter 6 Coverage
105
Theory and Applications Chapter 7 RoutingCost Constrained CDS
119
Theory and Applications Chapter 8 CDS in DiskContainment Graphs
133
Theory and Applications Chapter 9 CDS in DiskIntersection Graphs
150
Theory and Applications Chapter 10 Geometric Hitting Set and Disk Cover
161
Theory and Applications Chapter 11 MinimumLatency Scheduling
168
Theory and Applications Chapter 12 CDS in Planar Graphs
183
Theory and Applications References
193
Theory and Applications Index
200
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information