Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book tells the story of how China has managed to build a national pension system that now covers most of its population and what this system holds for its future.

Social security

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Domination (Graph theory). --- Mathematics. --- Set theory. --- Domination (Graph theory) --- Set theory --- Mathematics --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Operations Research --- Algebra --- Aggregates --- Classes (Mathematics) --- Ensembles (Mathematics) --- Mathematical sets --- Sets (Mathematics) --- Theory of sets --- Computer communication systems. --- Algorithms. --- Mathematical optimization. --- Operations research. --- Management science. --- Combinatorics. --- Operations Research, Management Science. --- Algorithm Analysis and Problem Complexity. --- Computer Communication Networks. --- Optimization. --- Combinatorics --- Mathematical analysis --- Quantitative business analysis --- Management --- Problem solving --- Operations research --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Maxima and minima --- Simulation methods --- System analysis --- Algorism --- Arithmetic --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Electronic data processing --- Network computers --- Math --- Science --- Foundations --- Distributed processing --- Logic, Symbolic and mathematical --- Graph theory --- Computer software. --- Software, Computer --- Computer systems

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Complex analysis --- Numerical methods of optimisation --- Operational research. Game theory --- Discrete mathematics --- Mathematical statistics --- Mathematics --- Planning (firm) --- Computer architecture. Operating systems --- Computer. Automation --- draadloze computernetwerken --- discrete wiskunde --- complexe analyse (wiskunde) --- bedrijfssoftware --- automatisering --- mathematische modellen --- econometrie --- wiskunde --- operationeel onderzoek --- computernetwerken