Ding-Zhu Du
id:
ding-zhu-du-285-18254687
title:
Ding-Zhu Du
text:
Ding-Zhu Du 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 ga
brand slug:
wiki
category slug:
encyclopedia
description:
American computer scientist
original url:
https://en.wikipedia.org/wiki/Ding-Zhu_Du
date created:
date modified:
2023-07-06T16:33:54Z
main entity:
{"identifier":"Q51920557","url":"https://www.wikidata.org/entity/Q51920557"}
image:
fields total:
13
integrity:
14