![](/Images/spacer.gif) |
![](/Images/menu_shadow.gif)
![](/Images/menu_shadow.gif)
|
![](/Images/spacer.gif) |
Item Details
Title:
|
CONNECTED DOMINATING SET: THEORY AND APPLICATIONS
|
By: |
Ding-Zhu Du, Wan Peng-Jun |
Format: |
Hardback |
![](/Images/divider_itemdetail_1a.gif)
List price:
|
£54.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
1461452414 |
ISBN 13: |
9781461452416 |
Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
Pub. date: |
27 October, 2012 |
Edition: |
2013 ed. |
Series: |
Springer Optimization and Its Applications 77 |
Pages: |
206 |
Description: |
This book reviews problems in connected dominating set theory, discussing motivation and overview, problem complexity analysis and approximation algorithm designs. Readers will clearly grasp background, formulation, major research results and open problems. |
Synopsis: |
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. |
Illustrations: |
X, 206 p. |
Publication: |
US |
Imprint: |
Springer-Verlag New York Inc. |
Returns: |
Non-returnable |
|
|
|
![](/images/spacer.gif) |
![](images/menu_shadow2.gif)
![](/Images/menu_shadow2left.gif)
|
![](/Images/menu_shadow2left.gif)
|
![](/Images/menu_shadow2left.gif)
|
![](/Images/menu_shadow2left.gif)
|
![](/Images/menu_shadow2left.gif)
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
![](/Images/menu_shadow2left.gif)
|
![](/Images/menu_shadow2left.gif)
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
![](/Images/menu_shadow2left.gif)
|
![](/Images/menu_shadow2left.gif)
|
|
![](/Images/spacer.gif) |