Graph and Combinatorial Algorithms in Streaming and Distributed Settings

Thời gian: 10:00 đến 11:30 Ngày 16/06/2022

Địa điểm: C101, VIASM

Báo cáo viên: Vũ Trọng Hoà - San Diego State University

Tóm tắt:

As big data emerges, researchers have developed new computational models that capture the essence of big data processing. Some popular models include the data stream and parallel/distributed models.

In this talk, we will go over a few example algorithmic problems in these settings such as densest subgraph, maximum set coverage, and graph coloring in these settings. This talk will highlight a few useful techniques such as sampling, sketching, threshold-greedy, etc. that might also be of independent interest.