Maximum weight independent set (MWIS) admits a 1/k-approximation in
indu...
Boob et al. [1] described an iterative peeling algorithm called Greedy++...
Matroids are a fundamental object of study in combinatorial optimization...
We consider the problem of maintaining a (1-ϵ)-approximation to the
dens...
We give an algorithm to find a minimum cut in an edge-weighted directed ...
We consider the fundamental problems of determining the rooted and globa...
We consider approximations for computing minimum weighted cuts in direct...
Li and Panigrahi, in recent work, obtained the first deterministic algor...
We present online algorithms for directed spanners and Steiner forests. ...
We develop fast near-linear time approximation algorithms for the
minimu...
The Circle Packing Theorem states that every planar graph can be represe...
Partial Set Cover (PSC) is a generalization of the well-studied Set Cove...
We consider approximation algorithms for packing integer programs (PIPs)...
We consider parallel, or low adaptivity, algorithms for submodular funct...
In the regime of bounded transportation costs, additive approximations f...
Karger used spanning tree packings to derive a near linear-time randomiz...
We consider approximation algorithms for covering integer programs of th...
Balkanski and Singer [5] recently initiated the study of adaptivity (or
...
In an undirected graph, a k-cut is a set of edges whose removal breaks t...
We develop faster approximation algorithms for Metric-TSP building on re...
We consider the problem of strongly-convex online optimization in presen...