
Minimum Cuts in Directed Graphs via Partial Sparsification
We give an algorithm to find a minimum cut in an edgeweighted directed ...
read it

Faster Algorithms for Rooted Connectivity in Directed Graphs
We consider the fundamental problems of determining the rooted and globa...
read it

Fast Approximations for Rooted Connectivity in Weighted Directed Graphs
We consider approximations for computing minimum weighted cuts in direct...
read it

Isolating Cuts, (Bi)Submodularity, and Faster Algorithms for Global Connectivity Problems
Li and Panigrahi, in recent work, obtained the first deterministic algor...
read it

Online Directed Spanners and Steiner Forests
We present online algorithms for directed spanners and Steiner forests. ...
read it

Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
We develop fast nearlinear time approximation algorithms for the minimu...
read it

Computing Circle Packing Representations of Planar Graphs
The Circle Packing Theorem states that every planar graph can be represe...
read it

On Approximating Partial Set Cover and Generalizations
Partial Set Cover (PSC) is a generalization of the wellstudied Set Cove...
read it

ℓ_1sparsity Approximation Bounds for Packing Integer Programs
We consider approximation algorithms for packing integer programs (PIPs)...
read it

Parallelizing greedy for submodular set function maximization in matroids and beyond
We consider parallel, or low adaptivity, algorithms for submodular funct...
read it

Approximating optimal transport with linear programs
In the regime of bounded transportation costs, additive approximations f...
read it

LP Relaxation and Tree Packing for Minimum kcuts
Karger used spanning tree packings to derive a near lineartime randomiz...
read it

On Approximating (Sparse) Covering Integer Programs
We consider approximation algorithms for covering integer programs of th...
read it

Submodular Function Maximization in Parallel via the Multilinear Relaxation
Balkanski and Singer [5] recently initiated the study of adaptivity (or ...
read it

Fast and Deterministic Approximations for kCut
In an undirected graph, a kcut is a set of edges whose removal breaks t...
read it

Fast Approximations for MetricTSP via Linear Programming
We develop faster approximation algorithms for MetricTSP building on re...
read it

Adversarial Delays in Online StronglyConvex Optimization
We consider the problem of stronglyconvex online optimization in presen...
read it
Kent Quanrud
is this you? claim profile