research
∙
11/07/2022
Approximating Nash Social Welfare by Matching and Local Search
For any ε>0, we give a simple, deterministic (6+ε)-approximation algorit...
share
research
∙
09/20/2022
On the Correlation Gap of Matroids
A set function can be extended to the unit cube in various ways; the cor...
research
∙
12/19/2021
Tractable Fragments of the Maximum Nash Welfare Problem
We study the problem of maximizing Nash welfare (MNW) while allocating i...
research
∙
07/14/2021
On complete classes of valuated matroids
We characterize a rich class of valuated matroids, called R-minor valuat...
research
∙
09/30/2020
Approximating Nash Social Welfare under Rado Valuations
We consider the problem of approximating maximum Nash social welfare (NS...
research
∙
07/19/2020
FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs
Dense subgraph detection is a fundamental problem in network analysis fo...
research
∙
08/21/2019
