Connected Dominating Set: Theory and Applications

  • Ding-Zhu Du
  • Peng-Jun Wan

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

Table of contents

  1. Front Matter
    Pages i-ix
  2. Ding-Zhu Du, Peng-Jun Wan
    Pages 1-9
  3. Ding-Zhu Du, Peng-Jun Wan
    Pages 11-34
  4. Ding-Zhu Du, Peng-Jun Wan
    Pages 35-62
  5. Ding-Zhu Du, Peng-Jun Wan
    Pages 63-75
  6. Ding-Zhu Du, Peng-Jun Wan
    Pages 77-104
  7. Ding-Zhu Du, Peng-Jun Wan
    Pages 105-118
  8. Ding-Zhu Du, Peng-Jun Wan
    Pages 119-131
  9. Ding-Zhu Du, Peng-Jun Wan
    Pages 133-149
  10. Ding-Zhu Du, Peng-Jun Wan
    Pages 151-159
  11. Ding-Zhu Du, Peng-Jun Wan
    Pages 161-167
  12. Ding-Zhu Du, Peng-Jun Wan
    Pages 169-182
  13. Ding-Zhu Du, Peng-Jun Wan
    Pages 183-191
  14. Back Matter
    Pages 193-203

About this book

Introduction

The connected dominating set (CDS) has been a classic subject studied in graph theory since 1975. It has been discovered in recent years that CDS has 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. This work is a valuable reference for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, industrial engineering, and discrete mathematics. The book may also be used as a text in a graduate seminar for PhD students. Readers should have a basic knowledge of computational complexity and combinatorial optimization.

In this book, the authors present the state-of-the-art in the study of connected dominating sets. Each chapter is devoted to one problem, and consists of three parts: motivation and overview, problem complexity analysis, and approximation algorithm designs. The text is designed to give the reader a clear understanding of the background, formulation, existing important research results, and open problems. Topics include minimum CDS, routing-cost constrained CDS, weighted CDS, directed CDS, SCDS (strongly connected dominating set), WCDS (weakly connected dominating set), CDS-partition, virtual backbone in wireless networks, convertor placement in optical networks, coverage in wireless sensor networks, and more.

Keywords

approximation algorithms complexity analysis connected dominating set network optimization wireless networks

Authors and affiliations

  • Ding-Zhu Du
    • 1
  • Peng-Jun Wan
    • 2
  1. 1., Department of Computer ScienceUniversity of Texas, DallasRichardsonUSA
  2. 2., Department of Computer ScienceIllinois Institute of TechnologyChicagoUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4614-5242-3
  • Copyright Information Springer Science+Business Media New York 2013
  • Publisher Name Springer, New York, NY
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-1-4614-5241-6
  • Online ISBN 978-1-4614-5242-3
  • Series Print ISSN 1931-6828
  • About this book