Search Results - Du, Ding-Zhu

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
  • Showing 1 - 2 results of 2
Refine Results
  1. 1

    Computational Social Networks

    Other Authors:
    Open Access
    Electronic Journal
  2. 2

    Computational Social Networks

    Other Authors:
    Open Access
    Electronic Journal