3 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications
Haotian Jiang, Yin Tat Lee, Zhao Song +1
Given a separation oracle for a convex set that is contained in a box of radius , the goal is to either compute a point in or prove that does no…
Faster Matroid Intersection
Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford +2
In this paper we consider the classic matroid intersection problem: given two matroids $\M_{1}=(V,\I_{1})$ and $\M_{2}=(V,\I_{2})$ defined over a common ground set , compute a s…
Network design for s-t effective resistance
Pak Hay Chan, Lap Chi Lau, Aaron Schild +2
We consider a new problem of designing a network with small - effective resistance. In this problem, we are given an undirected graph , two designated vertices $s,t…
Matroid Online Bipartite Matching and Vertex Cover
Yajun Wang, Sam Chiu-wai Wong
The Adwords and Online Bipartite Matching problems have enjoyed a renewed attention over the past decade due to their connection to Internet advertising. Our community has contribu…