archived 2026-08-23

latex/kor.tex

@@ -0,0 +1,101 @@
+\documentclass{article}
+\usepackage{kotex}
+\usepackage{float}
+\usepackage{hyperref}
+\hypersetup{
+    pdfborder={0 0 0}
+}
+\usepackage{graphicx}
+\graphicspath{{images/}}
+
+\usepackage{amsmath}
+
+\usepackage[style=apa,backend=biber]{biblatex} % 출처
+\addbibresource{references.bib}
+
+\setlength{\parindent}{0pt}
+\setlength{\parskip}{0.6em}
+\linespread{1.08}
+
+\title{When Asymptotic Complexity Fails: An Empirical and Cost-Based Study of Binary and Fibonacci Heaps in Python}
+\author{Seungjun Lee}
+\date{\today}
+
+\begin{document}
+
+\maketitle
+
+\newpage
+
+\tableofcontents
+
+\newpage
+
+\section{Introduction}
+최단 경로 문제는
+
+\newpage
+\section{Background}
+
+\subsection{Dijkstra's algorithm}
+
+\subsubsection*{Time Complexity}
+
+\subsection{Priority queue}
+
+\subsubsection*{Time Complexity}
+
+\subsection{Runtime}
+
+\newpage
+\section{Methodology}
+
+\subsection{Experimental Environment}
+
+\subsection{Real data}
+
+\subsection{Synthetic Graph Generation }
+
+\subsection{Analysis Strategy}
+
+\subsubsection{Decrease-key call count modeling}
+
+\subsubsection{Operation unit cost modeling}
+
+\subsubsection{Integrated prediction}
+
+\subsection{Validation Metrics}
+
+\newpage
+\section{Results}
+
+\subsection{Real data properties}
+
+\subsection{Decrease-key Call Number Prediction}
+
+\subsection{Operation Unit Cost Analysis}
+
+\subsection{Integrated Runtime Prediction}
+
+\newpage
+\section{Discussion}
+
+\subsection{Phase Transition as Regime Boundary}
+
+\subsection{Cache Effects in Unit Cost}
+
+\subsection{Asymptotic vs Empirical Cost}
+
+\subsection{Limitations}
+
+
+\newpage
+\section{Conclustion}
+
+\subsection{Summary of Contributions}
+
+\subsection{Practical Implications}
+
+\subsection{Future Work}
+
+\end{document}