Ding-Zhu Du

Edit links
Source: Wikipedia, the free encyclopedia.
Ding-Zhu Du
Born (1948-05-21) May 21, 1948 (age 76)
Scientific career
Fields
Computer algorithms
InstitutionsUniversity of Texas at Dallas
Thesis Generalized Complexity Cores And Levelability Of Intractable Sets  (1985)
Doctoral advisorRonald V. Book
Doctoral students
WebsiteDing-Zhu Du

Ding-Zhu Du (born May 21, 1948) is a Professor in the Department 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.[3] The proof of Gilbert-Pollak's conjecture on Steiner ratios was later found to have gaps, thus leaving the problem unsolved.[4]

Education

Ding-Zhu Du received his M.Sc in Operations Research from the Chinese Academy of Sciences in 1985. He received his Ph.D. in Mathematics with research area in Theoretical Computer Science from the University of California, Santa Barbara in 1984.[1]

Career

Early in his career he solved two long-standing open problems on the Euclidean minimum Steiner trees, the proof of Gilbert-Pollak's conjecture on the Steiner ratio, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio.[2]

He was Program Director for CISE/CCF, National Science Foundation, USA, 2002-2005,[5] Professor, Department of Computer Science, University of Minnesota, 1991-2005.[6] and Assistant Professor, Department of Mathematics, Massachusetts Institute of Technology, 1986-1987.

He has been active in research on Design and Analysis of Approximation Algorithm for 30 years. And over these years he has published 177 Journal articles, 60 conference and workshop papers, 22 editorship, 9 reference works and 11 informal publications.[7]

Books published

  • Theory of Computational Complexity.[8]
  • Problem Solving in Automata, Languages, and Complexity.[9]
  • Pooling Designs and Nonadaptive Group Testing.[10]
  • Mathematical Theory of Optimization.[11]
  • Combinatorial Group Testing and Its Applications (2nd Edition).[12]
  • Connected Dominating Set: Theory and Applications.[13]
  • Design and Analysis of Approximation Algorithms.[14]
  • Steiner Tree Problems In Computer Communication Networks.[15]

Awards and honors

References

  1. ^ a b "Du, Ding-Zhu - Department of Computer Science - The University of Texas at Dallas – Erik Jonsson School of Engineering and Computer Science". cs.utdallas.edu. Retrieved 2018-02-16.
  2. ^
    ISSN 0362-4331
    . Retrieved 2018-02-16.
  3. S2CID 17177695
    .
  4. S2CID 7486839
    .
  5. ^ "National Science Foundation" (PDF). National Science foundation.
  6. ^ "Ding-Zhu Du - The Mathematics Genealogy Project". www.genealogy.math.ndsu.nodak.edu. Retrieved 2018-02-16.
  7. ^ "dblp: Ding-Zhu Du". dblp.org. Retrieved 2018-02-16.
  8. OCLC 864753086.{{cite book}}: CS1 maint: location missing publisher (link
    )
  9. OCLC 53229117
    .
  10. OCLC 285162303
    .
  11. OCLC 47716389
    .
  12. OCLC 42421028
    .
  13. OCLC 819816599
    .
  14. OCLC 765365870
    .
  15. OCLC 263426948
    .
  16. ISBN 978-0-7803-7893-3
    .
Retrieved from "https://en.wikipedia.org/w/index.php?title=Ding-Zhu_Du&oldid=1163824558"