Vincent Cohen-Addad

activity

20162023

most citedBalanced power diagrams for redistricting

6 citations · 6 across the 5 of their papers we have counts for

collaborators

Showing 2021Show all

1 paper · 1 filter

cs.DS2021

A Quasipolynomial $(2 + ε)$ -Approximation for Planar Sparsest Cut

Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein +1

The (non-uniform) sparsest cut problem is the following graph-partitioning problem: given a "supply" graph, and demands on pairs of vertices, delete some subset of supply edges to…

A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut

A Quasipolynomial $(2 + ε)$ -Approximation for Planar Sparsest Cut