Connected Dominating Set: Theory and Applications. Questo articolo non è disponibile.Connected Dominating Set: Theory and Applications

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.

Weili Wu is an IEEE-fellow and a full professor in the Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA. She received the MS and PhD degrees from the Department of Computer Science, University of Minnesota, Minneapolis, MN, USA, in 1998 and 2002, respectively. She has published a large number of research articles in the general area of data communication and data management, including the design and analysis of algorithms for optimization problems that occur in wireless networking environments and various data systems. Zhang Zhao is a Distinguished Professor at Zhejiang Normal University. Her primary research focuses on the design and analysis of combinatorial optimization algorithms. She has led and completed four projects funded by NSFC (including the Fund for Excellent Young Scholars) and four projects funded by the Ministry of Education (including the New Century Excellent Talents Support Program). She has also won the First Prize in Scientific and Technological Progress of Xinjiang. Professor Zhang is a member of the 8th Mathematics Subject Evaluation Group of the Academic Degrees Committee of the State Council, an executive director of the Operations Research Society of China, an associate editor of Journal of Combinatorial Optimization, etc. Ding-Zhu Du is a professor at Department of Computer Science, the University of Texas at Dallas. He received his Master’s degree in 1982 from the Chinese Academy of Sciences and Ph.D. in 1985 from the University of California at Santa Barbara. His research areas include optimization theory and mathematical foundation of computer science. He had worked in MSRI (Berkeley), MIT, Chinese Academy of Sciences, Princeton University, University of Minnesota, and NSF of USA. He was granted the Natural Science First-Class Prize of the Chinese Academy of Sciences in 1992, the National Natural Science Second-Class Prize of China in 1993, the CSTS award of INFORMS in 1998, and the Constantin Caratheodory Prize in 2025.