Connected Dominating Set: Theory and Applications

Connected Dominating Set: Theory and Applications


View All Available Formats & Editions
Eligible for FREE SHIPPING
  • Get it by Thursday, September 28 , Order now and choose Expedited Delivery during checkout.


Connected Dominating Set: Theory and Applications by Ding-Zhu Du, Peng-Jun Wan

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.

Product Details

ISBN-13: 9781461452416
Publisher: Springer New York
Publication date: 10/27/2012
Series: Springer Optimization and Its Applications Series , #77
Edition description: 2013
Pages: 206
Product dimensions: 6.10(w) x 9.25(h) x 0.02(d)

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews