Signed-off-by: SeongJae Park <sj38.park@xxxxxxxxx>
---
future/QC.tex | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/future/QC.tex b/future/QC.tex
index f985437..f873cd7 100644
--- a/future/QC.tex
+++ b/future/QC.tex
@@ -1058,7 +1058,7 @@ of logistics, but current classic heuristics can find near-optimal
solutions for hundreds of cities~\cite{Martin:1992:LMC:2307953.2308141}
and polynomial-time algorithms that are guaranteed to find routes
that are no more than 40\% longer than optimal for arbitrarily
-large numbers of cities\cite{Sebo:2014:STN:2688265.2688281},
+large numbers of cities~\cite{Sebo:2014:STN:2688265.2688281},
improving on the 50\% bound located a few decades
earlier~\cite{NicosChristofides1976TSP-FiftyPercent}.
As of 2006 TSP solvers were finding optimal solutions to
--
2.10.0
--
To unsubscribe from this list: send the line "unsubscribe perfbook" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
