[{"@context":"http:\/\/schema.org\/","@type":"BlogPosting","@id":"https:\/\/wiki.edu.vn\/en\/wiki40\/ding-zhu-du-wikipedia\/#BlogPosting","mainEntityOfPage":"https:\/\/wiki.edu.vn\/en\/wiki40\/ding-zhu-du-wikipedia\/","headline":"Ding-Zhu Du – Wikipedia","name":"Ding-Zhu Du – Wikipedia","description":"From Wikipedia, the free encyclopedia American computer scientist Ding-Zhu Du (born May 21, 1948) is a Professor in the Department","datePublished":"2016-05-07","dateModified":"2016-05-07","author":{"@type":"Person","@id":"https:\/\/wiki.edu.vn\/en\/wiki40\/author\/lordneo\/#Person","name":"lordneo","url":"https:\/\/wiki.edu.vn\/en\/wiki40\/author\/lordneo\/","image":{"@type":"ImageObject","@id":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","height":96,"width":96}},"publisher":{"@type":"Organization","name":"Enzyklop\u00e4die","logo":{"@type":"ImageObject","@id":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","url":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","width":600,"height":60}},"image":{"@type":"ImageObject","@id":"https:\/\/en.wikipedia.org\/wiki\/Special:CentralAutoLogin\/start?type=1x1","url":"https:\/\/en.wikipedia.org\/wiki\/Special:CentralAutoLogin\/start?type=1x1","height":"1","width":"1"},"url":"https:\/\/wiki.edu.vn\/en\/wiki40\/ding-zhu-du-wikipedia\/","wordCount":3243,"articleBody":"From Wikipedia, the free encyclopediaAmerican computer scientistDing-Zhu Du (born May 21, 1948) is a Professor in the Department of Computer Science at The University of Texas at Dallas.[1] He has received public recognition when he solved two long-standing open problems on the Euclidean minimum Steiner trees,[2] the proof of Gilbert\u2013Pollack 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]Table of ContentsEducation[edit]Books published[edit]Awards and honors[edit]References[edit]Education[edit]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]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[edit]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[edit]2007 Received the Best Paper Award from International Conference on Wireless Algorithms, Systems and Applications (WASA\u201907), Chicago, Illinois, USA2009-2014 Honorary Dean of Science, Xi\u2019an Jiaotong University2003 Received the Best Paper Award from the 22nd IEEE International Performance, Computing, and Communication Conference at Phoenix, Arizona, USA, April 9\u201311.[16]1998 Received CSTS Prize from INFORMS (a merge of American Operations Research Society and Institute of Management Science) for research excellence in the interface between Operations Research and Computer Science1996 Received the 2nd Class National Natural Science Prize in China.1993 Received the 1st Class Natural Science Prize from Chinese Academy of Sciences.1992 Received the National Young Scientist Prize from China1990-1991 The proof of Gilbert\u2013Pollak conjecture was reported in The New York Times.[2]1989 Received the 1st Class Young Scientist Prize from Chinese Academy of Sciences, Beijing, China.1988 Received the 3rd Class National Natural Science Prize in China.References[edit]^ a b “Du, Ding-Zhu – Department of Computer Science – The University of Texas at Dallas \u2013 Erik Jonsson School of Engineering and Computer Science”. cs.utdallas.edu. Retrieved 2018-02-16.^ a b c Kolata, Gina (1990-10-30). “Solution to Old Puzzle: How Short a Shortcut?”. The New York Times. ISSN\u00a00362-4331. Retrieved 2018-02-16.^ “PROOF OF GILBERT-POLLAK CONJECTURE” (PDF). S2CID\u00a017177695. Archived from the original (PDF) on 2019-02-23. ^ Ivanov, A. O.; Tuzhilin, A. A. (2012). “The Steiner Ratio Gilbert\u2013Pollak Conjecture Is Still Open”. Algorithmica. 62 (1\u20132): 630\u2013632. doi:10.1007\/s00453-011-9508-3. S2CID\u00a07486839.^ “National Science Foundation” (PDF). National Science foundation.^ “Ding-Zhu Du – The Mathematics Genealogy Project”. www.genealogy.math.ndsu.nodak.edu. Retrieved 2018-02-16.^ “dblp: Ding-Zhu Du”. dblp.org. Retrieved 2018-02-16.^ Du, Dingzhu (2000-01-27). Theory of computational complexity. Ko, Ker-I (Second\u00a0ed.). Hoboken, New Jersey. ISBN\u00a0978-0471345060. OCLC\u00a0864753086.^ Du, Dingzhu (2001). Problem solving in automata, languages, and complexity. Ko, Ker-I. New York: Wiley. ISBN\u00a0978-0471439608. OCLC\u00a053229117.^ Du, Dingzhu (2006). Pooling designs and nonadaptive group testing\u00a0: important tools for DNA sequencing. Hwang, Frank. New Jersey: World Scientific. ISBN\u00a0978-9812568229. OCLC\u00a0285162303.^ Mathematical theory of optimization. Du, Dingzhu., Pardalos, P. M. (Panos M.), 1954-, Wu, Weili. Dordrecht: Kluwer Academic. 2001. ISBN\u00a0978-1402000157. OCLC\u00a047716389.{{cite book}}:  CS1 maint: others (link)^ Du, Dingzhu (2000). Combinatorial group testing and its applications. Hwang, Frank. (2nd\u00a0ed.). Singapore: World Scientific. ISBN\u00a0978-9810241070. OCLC\u00a042421028.^ Du, Dingzhu. (2013). Connected dominating set\u00a0: theory and applications. Wan, Peng-Jun, 1970-. New York: Springer Science+Business Media. ISBN\u00a09781461452423. OCLC\u00a0819816599.^ Du, Dingzhu (2012). Design and analysis of approximation algorithms. Ko, Ker-I., Hu, Xiaodong, 1962-. New York, NY: Springer. ISBN\u00a0978-1461417019. OCLC\u00a0765365870.^ Du, Dingzhu (2008). Steiner tree problems in computer communication networks. Hu, Xiaodong. Hackensack, NJ: World Scientific. ISBN\u00a0978-9812791443. OCLC\u00a0263426948.^ “Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference (Cat. No.03CH37463)”. Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003. 2003. doi:10.1109\/PCCC.2003.1201985. ISBN\u00a0978-0-7803-7893-3."},{"@context":"http:\/\/schema.org\/","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki40\/#breadcrumbitem","name":"Enzyklop\u00e4die"}},{"@type":"ListItem","position":2,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki40\/ding-zhu-du-wikipedia\/#breadcrumbitem","name":"Ding-Zhu Du – Wikipedia"}}]}]