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.
Attributes | Values |
---|---|
rdf:type | |
rdfs:label |
|
rdfs:comment |
|
foaf:name |
|
foaf:homepage | |
name |
|
birth date |
|
dcterms:subject | |
Wikipage page ID |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage |
|
Link from a Wikipage to an external page | |
sameAs | |
thesis title |
|
thesis year |
|
work institutions | |
dbp:wikiPageUsesTemplate | |
birth date |
|
field | |
website | |
has abstract |
|
doctoral advisor | |
doctoral students | |
doctoral advisor | |
doctoral student | |
schema:sameAs | |
prov:wasDerivedFrom | |
page length (characters) of wiki page |
|
academic discipline | |
foaf:isPrimaryTopicOf | |
is Link from a Wikipage to another Wikipage of |