research
∙
06/03/2023
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms
Dense subgraph discovery is an important problem in graph mining and net...
share
research
∙
11/06/2020
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
We develop fast near-linear time approximation algorithms for the minimu...
research
∙
02/22/2019
ℓ_1-sparsity Approximation Bounds for Packing Integer Programs
We consider approximation algorithms for packing integer programs (PIPs)...
research
∙
08/01/2018
