Springer Optimization and Its Applications

Connected Dominating Set: Theory and Applications

Authors: Du, Ding-Zhu, Wan, Peng-Jun

  • 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
see more benefits

Buy this book

eBook $54.99
price for USA (gross)
  • ISBN 978-1-4614-5242-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $69.95
price for USA
  • ISBN 978-1-4614-5241-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $69.95
price for USA
  • ISBN 978-1-4899-8714-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
About this Textbook

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.

Table of contents (12 chapters)

Buy this book

eBook $54.99
price for USA (gross)
  • ISBN 978-1-4614-5242-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $69.95
price for USA
  • ISBN 978-1-4614-5241-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $69.95
price for USA
  • ISBN 978-1-4899-8714-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Connected Dominating Set: Theory and Applications
Authors
Series Title
Springer Optimization and Its Applications
Series Volume
77
Copyright
2013
Publisher
Springer-Verlag New York
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4614-5242-3
DOI
10.1007/978-1-4614-5242-3
Hardcover ISBN
978-1-4614-5241-6
Softcover ISBN
978-1-4899-8714-3
Series ISSN
1931-6828
Edition Number
1
Number of Pages
X, 206
Topics