Schedule

Full talks

A Framework for k-Median and k-Means Approximation 

Fabrizio Grandoni (IDSIA, USI-SUPSI) 

The connected min-sum radii problem

Hyung-Chan An (Yonsei University) 

Submodular k-Partitioning via Principal Partition Sequence

Karthik Chandrasekaran (UIUC) 

Lightning talks

A Polylogarithmic Approximation for Buy-at-Bulk with Protection

Rhea Jain (UIUC) 

A Better-Than-5/4 Approximation for Two-Edge Connectivity

Alex Lindermayr (Simons Institute) 

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem [arxiv]

Olha Silina (CMU) 

Online Resource Allocation with Concave, Diminishing-Returns Objectives

Kalen Patton (Georgia Tech) 

Optimal Online Bipartite Matching in Degree-2 Graphs

Arghya Chakraborty (TIFR) 

Weighted k-server problem admits an exponentially-competitive algorithm [arxiv]

Adithya Bijoy (NUS) 

Full talks

Optimal Stopping with a Predicted Prior [arxiv]

Zhiyi Huang (HKU) 

The forbidden pattern method for graph sparsification

Greg Bodwin (University of Michigan) 

Short talks

Edmonds++: Efficiently Coloring More Matroid Intersections [arxiv]

Michael Zlatin (Pomona College) 

Unsplittable Multicommodity Flow in Undirected Graphs

Nikhil Kumar (TIFR) 

On the Capacitated Facility Location Problem and Multicommodity Flow Network Relaxation

Mong-Jen Kao (National Yang-Ming Chiao-Tung University) 

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth [arxiv]

Sorrachai Yingchareonthawornchai (ETH Zurich) 

Plenary talk

Breaking a Long-Standing Barrier: 2–ε Approximation for Steiner Forest

MohammadTaghi Hajiaghayi (University of Maryland) 

Full talks

Sequential Testing with Subadditive Costs

Viswanath Nagarajan (University of Michigan) 

Games of combinatorial optimization

Yuval Rabani (Hebrew University of Jerusalem) 

TBD

Chaitanya Swamy (University of Waterloo)

Full talk

On the Approximability of Directed Steiner Tree

Bundit Laekhanukit 

Lighting talks

Fair Transit Stop Placement: a Clustering Perspective and Beyond [arxiv]

Yuhang Guo (UNSW) 

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade [arxiv]

Simone di Gregorio (Sapienza University of Rome) 

A new algorithm analysis framework: By the book analysis [arxiv]

Eleon Bach (TU Munich) 

Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations

Siyue Liu (CMU) 

Maximum Matching in $\Theta(\log \log n)$ Passes in Dynamic Streams [arxiv]

Janani Sundaresan (University of Waterloo) 

Fast Nearest Neighbor Search for $\ell_p$ Metrics

Nir Petruschka (Weizmann Institute) 

Fully Dynamic k-Median with Near-Optimal Update Time and Recourse [arxiv, video]

Ermiya Farokhnejad (University of Warwick)