A quasipolynomial (2 + ε )-approximation for planar sparsest cut

DOI10.1145/3406325.3451103arXiv2105.15187OpenAlexW3167218181MaRDI QIDQ6065231

Anupam Gupta, Vincent Cohen-Addad, Jason Li, Philip N. Klein

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.15187

zbMATH Keywords

planar graphsgraph partitioningapproximation algorithmsLP roundingnon-uniform sparsest cut

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time

This page was built for publication: A quasipolynomial (2 + ε )-approximation for planar sparsest cut