Ding-Zhu Du
Ding-Zhu Du | |
|---|---|
| Scientific career | |
| Fields | Computer algorithms |
| Workplaces | University of Texas at Dallas |
| Thesis | Generalized Complexity Cores And Levelability Of Intractable Sets (1985) |
| Ronald V. Book | |
Doctoral students | |
| Website | www |
Ding-Zhu Du 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 the Gilbert–Pollak conjecture on the Steiner ratio, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio.