% GENERAL
\newcommand{\PROBLEMname}[1]{\textrm{#1}}

\newcommand{\PROBLEMinputs}{\mathcal{D}}
\newcommand{\PROBLEMinput}{I}
\newcommand{\PROBLEMsolution}{\sigma}
\newcommand{\PROBLEMsolutionsFor}[1]{S(#1)}
\newcommand{\PROBLEMsolutionsForInput}{\PROBLEMsolutionsFor{\PROBLEMinput}}
\newcommand{\PROBLEMoptimalSolutionFor}[1]{\text{OPT}(#1)}
\newcommand{\PROBLEMoptimalSolutionForInput}{\PROBLEMoptimalSolutionFor{\PROBLEMinput}}
\newcommand{\PROBLEMinputLength}{|\PROBLEMinput|}
\newcommand{\PROBLEMlength}{n}

% REDUCTION
\newcommand{\REDUCTION}[2]{$#1 \leq_{\textrm{T}} #2$}

% GÜTE
\newcommand{\GUETEguaranteedAlgo}[1]{\rho_{#1}}
\newcommand{\GUETEguaranteed}{\GUETEguaranteedAlgo{\ALGOapprox}}
\newcommand{\GUETEguaranteedForInput}{\GUETEguaranteed(\PROBLEMinput)}
\newcommand{\GUETEguaranteedForLength}{\GUETEguaranteed(\PROBLEMlength)}
\newcommand{\GUETEdeviance}{\rho'_\ALGOapprox}
\newcommand{\GUETEworstCase}{\rho_A^{wc}}
\newcommand{\GUETEworstCaseForLength}{\GUETEworstCase(\PROBLEMlength)}

% ERRORS
\newcommand{\ERRORrelative}{\epsilon_\ALGOapprox}
\newcommand{\ERRORrelativeForLength}{\ERRORrelative(\PROBLEMlength)}

% Traveling Salesman Problem
\newcommand{\PROBLEMtsp}{\PROBLEMname{TSP}}
\newcommand{\PROBLEMtspOfGuete}[1]{\PROBLEMtsp[#1]}
\newcommand{\PROBLEMtspMetric}{\Delta\PROBLEMtsp}

% Hamilton
\newcommand{\PROBLEMhamilton}{\PROBLEMname{HAMILTON}}

% Minimal Spanning Tree
\newcommand{\PROBLEMmst}{MST}