Logo - springer
Slogan - springer

Mathematics - Applications | Connected Dominating Set: Theory and Applications

Connected Dominating Set: Theory and Applications

Du, Ding-Zhu, Wan, Peng-Jun

2013, X, 206 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$49.99

(net) price for USA

ISBN 978-1-4614-5242-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$69.95

(net) price for USA

ISBN 978-1-4614-5241-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$69.95

(net) price for USA

ISBN 978-1-4899-8714-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • 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

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.

Content Level » Graduate

Keywords » approximation algorithms - complexity analysis - connected dominating set - network optimization - wireless networks

Related subjects » Applications - Communication Networks - Mathematics - Theoretical Computer Science

Table of contents 

-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

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Operations Research, Mathematical Programming.