24 citations · 58 across the 19 of their papers we have counts for
5 papers · 1 filter
Minor Sparsifiers and the Distributed Laplacian Paradigm
Sebastian Forster, Gramoz Goranci, Yang P. Liu +3
We study distributed algorithms built around minor-based vertex sparsifiers, and give the first algorithm in the CONGEST model for solving linear systems in graph Laplacian matrice…
Vertex Sparsification for Edge Connectivity in Polynomial Time
Yang P. Liu
An important open question in the area of vertex sparsification is whether -approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. T…
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +5
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether -approximate cut-prese…
Discrepancy Minimization via a Self-Balancing Walk
Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney
We study discrepancy minimization for vectors in under various settings. The main result is the analysis of a new simple random process in multiple dimensions throug…
Faster Divergence Maximization for Faster Maximum Flow
Yang P. Liu, Aaron Sidford
In this paper we provide an algorithm which given any -edge -vertex directed graph with integer capacities at most computes a maximum - flow for any vertices an…