Skip to main content

Connected Dominating Set: Theory and Applications

  • Textbook
  • © 2013

Access provided by Autonomous University of Puebla

Overview

  • This unique book may be used as a reference and/or supplementary text in a graduate seminar
  • The expository content and complete list of references in each chapter bring the reader quickly to the forefront of research
  • Wide applications of connected dominating sets attract readers not only from optimization and theoretical computer science, but also from computer communication networks and industrial engineering

Part of the book series: Springer Optimization and Its Applications (SOIA, volume 77)

Buy print copy

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (12 chapters)

Authors and Affiliations

  • , Department of Computer Science, University of Texas, Dallas, Richardson, USA

    Ding-Zhu Du

  • , Department of Computer Science, Illinois Institute of Technology, Chicago, USA

    Peng-Jun Wan

Bibliographic Information

Publish with us