sxlxc/sparsest-cut
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

approx rate for general graph sparsest cut

Browse Source
This commit is contained in:
Yu Cong
2025-05-10 14:36:22 +08:00
parent a4b9fbaaeb
commit 2cdc315849
3 changed files with 164 additions and 145 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
main.tex
View File

@@ -56,7 +56,11 @@ One major open problem for \scut{} is the best approximation ratio for planar gr
\section{Literature Review}
% Requirement: summarize previous research contributions and identify the gap or the specific problem
The seminal work of \cite{leighton_multicommodity_1999} starts this line of research. They studied multicommodity flow problem and proved a $O(\log n)$ flow-cut gap. They also developed $O(\log n)$ approximation algorithm for multicommodity flow problems, which can imply $O(\log n)$ approximation for \scut{} and $O(\log^2 n)$ approximation for \nonuscut{}. The technique is called region growing. They also discovered a lowerbound of $\Omega(\log n)$ via expanders. Note that any algorithm achieving the $O(\log n)$ flow cut gap implies an $O(\log^2 n)$ approximation for \nonuscut{}, but it is possible to approximate (non-uniform) \scut{} with better ratio. This paper showed that $O(\log^2 n)$ is the best ratio we can achieve using flow-cut gap.
For \nonuscut{} \citep{leighton_multicommodity_1999} only guarantees a $O(\log^2 n)$ approximation. This is further improved by \citep{Linial_London_Rabinovich_1995} and \citep{lognGapAumann98}. \cite{lognGapAumann98} applied metric embedding to \nonuscut{} and obtained a $O(\log n)$ approximation. The connections between metric embedding and \nonuscut{} is influential. \nonuscut{} can be formulated as an integer program. \citeauthor{lognGapAumann98} considered the metric relaxation of the IP. They observed that \nonuscut{} is polynomial time solvable for trees and more generally for all $\ell_1$ metrics. The $O(\log n)$ approximation follows from the $O(\log n)$ distortion in the metric embedding theorem.
\citep{arora_expander_2004} and \citep{arora_osqrtlogn_2010} further improved the approximation ratio for \scut{} to $O(\sqrt{\log n})$ via semidefinite relaxation. This is currently the best approximation ratio for \scut{}.
\section{The Research Design}
% Requirement : Your research design may include exact details of your design and the information should be presented in coherent paragraphs:
% Example: