BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20190315T140000
DTEND;TZID=America/New_York:20190315T160000
DTSTAMP:20260422T173011
CREATED:20210629T210717Z
LAST-MODIFIED:20210629T210717Z
UID:1962250-1552658400-1552665600@www.cs.jhu.edu
SUMMARY:Computer Science Student Defense: Zeyu Zhang\, Johns Hopkins University – “Approximation Algorithms and Hardnesses for Compressing Graphs with Distance Constraints”
DESCRIPTION:LocationMalone 107AbstractGraphs have been widely utilized in network design and other applications. A natural question is\, can we keep as few edges of the original graph as possible\, but still make sure that the vertices are connected within certain distance constraints.In this thesis\, we will consider different versions of graph compression problems\, including graph spanners\, approximate distance oracles\, and Steiner networks. Since these problems are all $mathrm{NP}$-hard problems\, we will mostly focus on designing approximation algorithms and proving inapproximability results.BioI am a Ph.D. candidate advised by Professor Michael Dinitz in the Department of Computer Science at Johns Hopkins University. My research focuses on approximation algorithms and graph algorithms. I received a B.S. in Mathematics from Tsinghua University in 2014.HostMichael Dinitz
URL:https://www.cs.jhu.edu/event/computer-science-student-defense-zeyu-zhang-johns-hopkins-university-approximation-algorithms-and-hardnesses-for-compressing-graphs-with-distance-constraints/
END:VEVENT
END:VCALENDAR