About: Ding-Zhu Du     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : wikidata:Q901, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDing-Zhu_Du&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

AttributesValues
rdf:type
rdfs:label
  • Ding-Zhu Du (en)
  • 堵丁柱 (zh)
rdfs:comment
  • 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. (en)
  • 堵丁柱(1948年5月21日-),美籍华裔计算机科学家,德克萨斯州大学达拉斯分校计算机科学教授。他因为证明了Gilbert-Pollak猜想和Derman-Leiberman-Ross猜想而著名。 (zh)
foaf:name
  • Ding-Zhu Du (en)
foaf:homepage
name
  • Ding-Zhu Du (en)
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
  • Generalized Complexity Cores And Levelability Of Intractable Sets (en)
thesis year
work institutions
dbp:wikiPageUsesTemplate
birth date
field
website
has abstract
  • 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. (en)
  • 堵丁柱(1948年5月21日-),美籍华裔计算机科学家,德克萨斯州大学达拉斯分校计算机科学教授。他因为证明了Gilbert-Pollak猜想和Derman-Leiberman-Ross猜想而著名。 (zh)
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
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 62 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software