ISBN: 9781461452416 - connected dominating set: theory and applications (springer optimization and its applications, 77, band 77) (3 Ergebnisse)

ISBN: 
Mit der Detailsuche verfeinern

Optimieren Sie Ihre Suche

  • Bücher (3)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

  • Sprache: Englisch

    Verlag: Springer Verlag, 2012

    1461452414 / 9781461452416

    Serie: Buch 66 von 176 - Springer Optimization and Its Applications

    • Hardcover

    Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 81,43

    EUR 12,00 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 2 verfügbar

    Hardcover. Zustand: Brand New. 2013 edition. 212 pages. 9.21x0.79x6.46 inches. In Stock.

  • Sprache: Englisch

    Verlag: Springer, 2012

    1461452414 / 9781461452416

    Serie: Buch 66 von 176 - Springer Optimization and Its Applications

    • Hardcover

    Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 64,87

    EUR 35,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

  • Sprache: Englisch

    Verlag: Springer New York, 2012

    1461452414 / 9781461452416

    Serie: Buch 66 von 176 - Springer Optimization and Its Applications

    • Hardcover

    Anbieter: Buchpark, Trebbin, DeutschlandBuchpark

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Sehr gut

    Sonderangebot

    Aktueller Preis: EUR 39,64

    EUR 105,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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.…