Connected dominating set : theory and applications

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...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Du, Dingzhu, 1948-, Wan, Peng-Jun, 1970- (Auteur)
Format: Livre numérique
Langue:Anglais
Publié: New York, NY : Springer New York 2013.
Cham : Springer Nature
Collection:Springer Optimization and Its Applications 77
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Connected Dominating Set: Theory and Applications, Texte imprimé, 9781461452416
• Connected Dominating Set: Theory and Applications, Texte imprimé, 9781461452430
• Connected Dominating Set: Theory and Applications, Texte imprimé, 9781489987143
Description
Résumé: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.
Description:Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
ISBN:9781461452423
ISSN:1931-6836
Accès:Accès en ligne pour les établissements français bénéficiaires des licences nationales
Accès soumis à abonnement pour tout autre établissement
Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017