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

4
by Du, Ding-Zhu, Wan, Peng-Jun
Published 2013
Springer New York

5
by Du, Ding-Zhu, Ko, Ker-I., Hu, Xiaodong
Published 2012
Springer New York

6
by Wu, Weili, Zhang, Zhao, Lee, Wonjun, Du, Ding-Zhu
Published 2020
Springer International Publishing

7
by Du, Ding-Zhu, Pardalos, Panos M., Hu, Xiaodong, Wu, Weili
Published 2022
Springer International Publishing

8
Published 1995
Springer Berlin Heidelberg
Other Authors: ...Du, Ding-Zhu...

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

10
Published 2013
Springer Berlin Heidelberg
Other Authors: ...Du, Ding-Zhu...

11
Published 2011
Springer Berlin Heidelberg
Other Authors: ...Du, Ding-Zhu...

12
Published 2020
Springer International Publishing
Other Authors: ...Du, Ding-Zhu...

13
Published 1994
Springer Berlin Heidelberg
Other Authors: ...Du, Ding-Zhu...

14
Published 1999
Springer US
Other Authors: ...Du, Ding-Zhu...

15
Published 2008
Springer Berlin Heidelberg
Other Authors: ...Du, Ding-Zhu...

16
Published 2005
Springer US
Other Authors: ...Du, Ding-Zhu...

17
Published 2007
Springer US
Other Authors: ...Du, Ding-Zhu...

18
Published 2011
Springer Berlin Heidelberg
Other Authors: ...Du, Ding-Zhu...

19
Published 2020
Springer International Publishing
Other Authors: ...Du, Ding-Zhu...

20
Published 2019
Springer International Publishing
Other Authors: ...Du, Ding-Zhu...