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 has received public recognition when he solved two long-standing open problems on the Euclidean minimum Steiner trees, the proof of Gilbert–Pollack conjecture on the Steiner ratio of the Euclidean plane, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio. The proof of Gilbert-Pollak's conjecture on Steiner ratios was later found to have gaps, thus leaving the problem unsolved. Provided by Wikipedia

1
by Ding-Zhu Du, Pardalos, Panos M.
Published 1998
Springer US

2
by Ding-Zhu Du, Pardalos, Panos M., Weili Wu
Published 2001
Springer US

3
by Xiaohua Jia, Xiao-Dong Hu, Ding-Zhu Du
Published 2002
Springer US

4
Published 1994
Springer US
Other Authors: ...Ding-Zhu Du...

5
Published 2001
Springer US
Other Authors: ...Ding-Zhu Du...

6
Published 1996
Springer US
Other Authors: ...Ding-Zhu Du...

7
Published 1997
Springer US
Other Authors: ...Ding-Zhu Du...

8
Published 2001
Springer US
Other Authors: ...Ding-Zhu Du...

9
Published 1995
Springer US
Other Authors: ...Ding-Zhu Du...

10
Published 2001
Springer US
Other Authors: ...Ding-Zhu Du...

11
Published 2004
Springer US
Other Authors: ...Ding-Zhu Du...