O(√log n) APPROXIMATION TO SPARSEST CUT IN (O)over-bar(n2) TIME

被引：30

作者：

Arora, Sanjeev ^{[1
]}

Hazan, Elad ^{[2
]}

Kale, Satyen ^{[3
]}

机构：

[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08540 USA

[2] IBM Almaden, San Jose, CA 95120 USA

[3] Yahoo Res, Santa Clara, CA 95054 USA

来源：

SIAM JOURNAL ON COMPUTING | 2010年 / 39卷 / 05期

关键词：

graph partitioning; expander flows; multiplicative weights; CONCURRENT FLOW PROBLEM; ALGORITHMS; GRAPHS;

D O I：

10.1137/080731049

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper shows how to compute O(root log n)-approximations to the SPARSEST CUT and BALANCED SEPARATOR problems in (O) over tilde (n(2)) time, thus improving upon the recent algorithm of Arora, Rao, and Vazirani [Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 222-231]. Their algorithm uses semidefinite programming and requires (O) over tilde (n(9.5)) time. Our algorithm relies on efficiently finding expander flows in the graph and does not solve semidefinite programs. The existence of expander flows was also established by Arora, Rao, and Vazirani [Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 222-231].

引用

页码：1748 / 1771

页数：24

共 50 条

[1] O(√log n) approximation to SPARSEST CUT in (O)over-tilde(n2) time
Arora, S
Hazan, E
Kale, S
45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 238 - 247
[2] A Simpler and Parallelizable O(√log n)-approximation Algorithm for SPARSEST CUT
Kolmogorov, Vladimir
PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 403 - 414
[3] A simpler and parallelizable O(√log n)-approximation algorithm for Sparsest Cut
Kolmogorov, Vladimir
arXiv, 2023,
[4] An O(√n)-approximation algorithm for directed sparsest cut
Hajiaghayi, MT
Räcke, H
INFORMATION PROCESSING LETTERS, 2006, 97 (04) : 156 - 160
[5] Breaking the Multicommodity Flow Barrier for O(√log n)-Approximations to Sparsest Cut
Sherman, Jonah
2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 363 - 372
[6] SIMULATED OBSERVATIONS OF THE ELECTRON CORONAL DENSITY IRREGULARITY (N2)OVER-BAR ((N)OVER-BAR)2
ROMOLI, M
FINESCHI, S
SPACE SCIENCE REVIEWS, 1994, 70 (1-2) : 359 - 363
[7] A O(n log2 n) Checker and O(n2 log n) Filtering Algorithm for the Energetic Reasoning
Ouellet, Yanick
Quimper, Claude-Guy
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 477 - 494
[8] Minimum Cut of Directed Planar Graphs in O(n log log n) Time
Mozes, Shay
Nikolaev, Kirill
Nussbaum, Yahav
Weimann, Oren
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
[9] Minimum Cut in O(m log2 n) Time
Gawrychowski, Pawel
Mozes, Shay
Weimann, Oren
THEORY OF COMPUTING SYSTEMS, 2024, 68 (04) : 814 - 834
[10] A SHORTEST-PATH ALGORITHM WITH EXPECTED TIME O(N2 LOG N LOGSTAR N)
BLONIARZ, PA
SIAM JOURNAL ON COMPUTING, 1983, 12 (03) : 588 - 600

← 1 2 3 4 5 →