000 03531nam a22005535i 4500
001 978-1-4614-5242-3
003 DE-He213
005 20140220082819.0
007 cr nn 008mamaa
008 121026s2013 xxu| s |||| 0|eng d
020 _a9781461452423
_9978-1-4614-5242-3
024 7 _a10.1007/978-1-4614-5242-3
_2doi
050 4 _aQA402-402.37
050 4 _aT57.6-57.97
072 7 _aKJT
_2bicssc
072 7 _aKJM
_2bicssc
072 7 _aBUS049000
_2bisacsh
072 7 _aBUS042000
_2bisacsh
082 0 4 _a519.6
_223
100 1 _aDu, Ding-Zhu.
_eauthor.
245 1 0 _aConnected Dominating Set: Theory and Applications
_h[electronic resource] /
_cby Ding-Zhu Du, Peng-Jun Wan.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2013.
300 _aIX, 203 p. 72 illus., 6 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSpringer Optimization and Its Applications,
_x1931-6828 ;
_v77
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.
650 0 _aMathematics.
650 0 _aComputer Communication Networks.
650 0 _aComputer software.
650 0 _aCombinatorics.
650 0 _aMathematical optimization.
650 1 4 _aMathematics.
650 2 4 _aOperations Research, Management Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aCombinatorics.
650 2 4 _aComputer Communication Networks.
650 2 4 _aOptimization.
700 1 _aWan, Peng-Jun.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461452416
830 0 _aSpringer Optimization and Its Applications,
_x1931-6828 ;
_v77
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-5242-3
912 _aZDB-2-SMA
999 _c95357
_d95357