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

...

Browse Source
This commit is contained in:
Yu Cong 2025-05-10 15:40:08 +08:00
parent 81c7b05c9b
commit 5a59d520fe
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
main.pdf
View File

Binary file not shown.

6
main.tex
View File

@ -3,8 +3,8 @@
\usepackage{natbib} \usepackage{natbib}
\title{Approximation Algorithms for Sparsest Cut} \title{Sparsest Cut}
\author{Class 4. \zh{丛宇}, 202411081537\\ Major: Theoretical Computer Science} \author{}
\date{} \date{}
\DeclareMathOperator*{\opt}{OPT} \DeclareMathOperator*{\opt}{OPT}
@ -16,7 +16,7 @@
\begin{document} \begin{document}
\maketitle \maketitle
\paragraph{Research problem} What is the best possible approximation rate of linear programming based approximation algorithms for \scut? What about algorithms for planar graphs? % \paragraph{Research problem} What is the best possible approximation rate of linear programming based approximation algorithms for \scut? What about algorithms for planar graphs?
\section{Introduction} \section{Introduction}
% Requirement: The introduction may have the following parts: % Requirement: The introduction may have the following parts: