BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Asia/Kolkata
X-WR-TIMEZONE:Asia/Kolkata
BEGIN:VEVENT
UID:25@cds.iisc.ac.in
DTSTART;TZID=Asia/Kolkata:20231222T110000
DTEND;TZID=Asia/Kolkata:20231222T120000
DTSTAMP:20231222T073909Z
URL:https://cds.iisc.ac.in/events/seminar-cds-102-22nd-december-matchings-
 in-big-graphs-approximation-and-streaming-algorithms/
SUMMARY:{Seminar} @ CDS: #102 : 22nd December: "Matchings in Big Graphs: Ap
 proximation and Streaming Algorithms"
DESCRIPTION:Department of Computational and Data Sciences\n\nDepartment Sem
 inar\n\n\n\nSpeaker : Prof. Alex Pothen\, Purdue University\n\nTitle : "Ma
 tchings in Big Graphs: Approximation and Streaming Algorithms"\n\nDate &am
 p\; Time : December 22\, 2023\, 11:00 AM\n\nVenue : # 102\, CDS Seminar Ha
 ll\n\n\n\nABSTRACT\n\nMatchings in graphs are classical problems in combin
 atorial optimization and computer science\, significant due to their theor
 etical importance and relevance to applications. Polynomial time algorithm
 s for several variant matching problems with linear objective functions ha
 ve been known for fifty years. However\, these algorithms fail to compute 
 matchings in big graphs with billions of edges. They are also not concurre
 nt and thus practical parallel algorithms are not known.\n\nThis has led t
 o work in the last twenty years on designing approximation algorithms for 
 variant matching problems with near-linear time complexity in the size of 
 the graphs. Approximation has thus become a useful paradigm for designing 
 parallel matching algorithms. In this talk I will report on fast approxima
 tion algorithms and streaming algorithms for the maximization versions of 
 edge-weighted matching\, edge-weighted b-matching\, and the maximum k-disj
 oint weighted matching problems. We will also describe applications to air
 craft design\, traffic routing in data centers and load balancing in quant
 um chemistry.\n\nBIOGRAPHY\n\nAlex Pothen is a professor of computer scien
 ce at Purdue University. His research interests are in combinatorial scien
 tific computing\, graph algorithms and parallel computing. He received the
  George Polya prize in applied combinatorics from the Society for Industri
 al and Applied Mathematics (SIAM) in 2021 for his work on graph coloring a
 lgorithms to enable Jacobian and Hessian matrix computations for optimizat
 ion. He is a Fellow of SIAM\, ACM and AMS.\n\nHost Faculty: Prof. Sashikum
 aar Ganesan\n\n\n\nALL ARE WELCOME
CATEGORIES:Events,Talks
END:VEVENT
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
X-LIC-LOCATION:Asia/Kolkata
BEGIN:STANDARD
DTSTART:20221222T110000
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
END:STANDARD
END:VTIMEZONE
END:VCALENDAR