000 03176nam a22003735i 4500
001 287937
003 MX-SnUAN
005 20170705134216.0
007 cr nn 008mamaa
008 150903s2013 xxu| o |||| 0|eng d
020 _a9781461452423
_99781461452423
024 7 _a10.1007/9781461452423
_2doi
035 _avtls000341564
039 9 _a201509030330
_bVLOAD
_c201405050230
_dVLOAD
_y201402061102
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA402-402.37
100 1 _aDu, Ding-Zhu.
_eautor
_9300903
245 1 0 _aConnected Dominating Set: Theory and Applications /
_cby Ding-Zhu Du, Peng-Jun Wan.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2013.
300 _aIx, 203 páginas 72 ilustraciones, 6 ilustraciones en color.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aSpringer Optimization and Its Applications,
_x1931-6828 ;
_v77
500 _aSpringer eBooks
520 _aThe 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aWan, Peng-Jun.
_eautor
_9317399
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9781461452416
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4614-5242-3
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c287937
_d287937