Buch, Englisch, Band 77, 206 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 3343 g
Buch, Englisch, Band 77, 206 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 3343 g
Reihe: Springer Optimization and Its Applications
ISBN: 978-1-4899-8714-3
Verlag: Springer
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.
Zielgruppe
Graduate
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
- Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
- Mathematik | Informatik EDV | Informatik Computerkommunikation & -vernetzung
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
Weitere Infos & Material
-Preface.-1. Introduction.-2. CDS in General Graph-3. CDS in Unit Disk Graph.-4. CDS in Unit Ball Graphs and Growth Bounded Graphs.-5. Weighted CDS in Unit Disk Graph.-6. Coverage.-7. Routing-Cost Constrained CDS.-8. CDS in Disk-Containment Graphs.-9. CDS in Disk-Intersection Graphs.-10. Geometric Hitting Set and Disk Cover.-11. Minimum-Latency Scheduling.-12 CDS in Planar Graphs.-Bibliography
