112,13 €
124,59 €
-10% with code: EXTRA
Connected Dominating Set: Theory and Applications
Connected Dominating Set: Theory and Applications
112,13
124,59 €
  • We will send in 10–14 business days.
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…
  • Publisher:
  • ISBN-10: 1489987142
  • ISBN-13: 9781489987143
  • Format: 15.6 x 23.4 x 1.2 cm, softcover
  • Language: English
  • SAVE -10% with code: EXTRA

Connected Dominating Set: Theory and Applications (e-book) (used book) | bookbook.eu

Reviews

Description

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.

EXTRA 10 % discount with code: EXTRA

112,13
124,59 €
We will send in 10–14 business days.

The promotion ends in 20d.17:38:58

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 1,25 Book Euros!?
  • Author: Ding-Zhu Du
  • Publisher:
  • ISBN-10: 1489987142
  • ISBN-13: 9781489987143
  • Format: 15.6 x 23.4 x 1.2 cm, softcover
  • Language: English English

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)