Mingquan Ye

activity

20182025

most citedUniversally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

2 citations · 2 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

$O (lo g n)$ -Approximation Algorithms for Bipartiteness Ratio

Tasuku Soma, Mingquan Ye, Yuichi Yoshida

We propose an $O (lo g n)$ -approximation algorithm for the bipartiteness ratio of undirected graphs introduced by Trevisan (SIAM Journal on Computing, vol. 41, no. 6, 2012), where $…

cs.DS2023

Streaming Semidefinite Programs: $O (n)$ Passes, Small Space and Fast Runtime

Zhao Song, Mingquan Ye, Lichen Zhang

We study the problem of solving semidefinite programs (SDP) in the streaming model. Specifically, $m$ constraint matrices and a target matrix $C$ , all of size $n \times n$ together…

cs.DS2021★ 2 cited

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

Goran Zuzic, Gramoz Goranci, Mingquan Ye +2

We provide universally-optimal distributed graph algorithms for $(1 + ε)$ -approximate shortest path problems including shortest-path-tree and transshipment. The universal o…

O(logn)-Approximation Algorithms for Bipartiteness Ratio

Streaming Semidefinite Programs: O(n​) Passes, Small Space and Fast Runtime

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

$O (lo g n)$ -Approximation Algorithms for Bipartiteness Ratio

Streaming Semidefinite Programs: $O (n)$ Passes, Small Space and Fast Runtime