Hakutulokset: Ding-Zhu Du
yhteensä 112 hakutulosta
Advances in Optimization and Approximation
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 …
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 …
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 …
Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing
Pooling designs have been widely used in various aspects of DNA sequencing. In biological applications, the well-studied mathematical problem called "e;group testing"e; …
Wireless Algorithms, Systems, and Applications
This book constitutes the refereed proceedings of the 4th Annual International Conference on Wireless Algorithms, Systems, and Applications, WASA 2009, held in Boston, MA, USA, in …
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 …
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 …
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 …