Ding-Zhu Du

Ding-Zhu Du (born May 21, 1948) is a Professor in the Department of Computer Science at The University of Texas at Dallas. He is known for his research on the Euclidean minimum Steiner trees, including an attempted proof of Gilbert–Pollak conjecture on the Steiner ratio, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio. Provided by Wikipedia
1
Cover Image
by Du, Ding-Zhu., Wan, Peng-Jun.
Published 2013
Get full text
Electronic
2
Cover Image
Published 2013
Other Authors: '; “...Du, Ding-Zhu....”
Get full text
Electronic
3
Cover Image
Published 2009
Other Authors: '; “...Du, Ding-Zhu....”
Get full text
Electronic
4
Cover Image
Published 2009
Other Authors: '; “...Du, Ding-Zhu....”
Get full text
Electronic
5
Cover Image
Published 2009
Other Authors: '; “...Du, Ding-Zhu....”
Get full text
Electronic
6
Cover Image
Published 2013
Other Authors: '; “...Du, Ding-Zhu....”
Get full text
Electronic
7
Cover Image
Published 2010
Other Authors: '; “...Du, Ding-Zhu....”
Get full text
Electronic
Search Tools: Get RSS Feed — Email this Search

Related Subjects

Algorithm Analysis and Problem Complexity Computer Communication Networks Computer Science Computer science Computer software Computational complexity Discrete Mathematics in Computer Science Software engineering Algorithms Coding and Information Theory Coding theory Combinatorics Logic design Logics and Meanings of Programs Mathematical optimization Mathematics Optimization Software Engineering Artificial Intelligence (incl. Robotics) Artificial intelligence Computation by Abstract Devices Computer Systems Organization and Communication Networks Computer network architectures Computer system performance Data Encryption Data Structures, Cryptology and Information Theory Data encryption (Computer science) Data structures (Computer science) Electronic data processing Information Systems Applications (incl.Internet)