Hakutulokset: Kirjoja kirjailijalta Du Ding-zhu Du
yhteensä 119 hakutulosta
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 …
Computing and Combinatorics
This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised …
Computing and Combinatorics
This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019. The 55 papers presented …
Recent Advances In Nonsmooth Optimization
Nonsmooth optimization covers the minimization or maximization of functions which do not have the differentiability properties required by classical methods. The field of nonsmooth …
Combinatorial Optimization and Applications
This book constitutes the refereed proceedings of the 8th International Conference on Combinatorial Optimization and Applications, COCOA 2014, held on the island of Maui, Hawaii, …
Computing and Combinatorics
This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 …
Advances in Optimization and Approximation
2. The Algorithm ...59 3. Convergence Analysis ..., ...60 4. Complexity Analysis ...63 5. Conclusions ...67 References ...67 A Simple Proof for a Result of Ollerenshaw on Steiner …
Advances in Algorithms, Languages, and Complexity
This book contains a collection of survey papers in the areas of algorithms, lan guages and complexity, the three areas in which Professor Ronald V. Book has made significant …
Complexity and Approximation
This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and …
Advances in Optimization and Approximation
2. The Algorithm ...59 3. Convergence Analysis ..., ...60 4. Complexity Analysis ...63 5. Conclusions ...67 References ...67 A Simple Proof for a Result of Ollerenshaw on Steiner …
Combinatorial Network Theory
A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize …
Network Optimization Problems: Algorithms, Applications And Complexity
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems …