Exponential approximation schemata for some network design problems

Arora, 1998, Polynomial-time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of the ACM, 45, 753, 10.1145/290179.290180 Barvinok, 2002, The maximum traveling salesman problem, vol. 12 Bern, 1989, The Steiner problem with edge lengths 1 and 2, Information Processing Letters, 32, 171, 10.1016/0020-0190(89)90039-2 Björklund, 2010, Determinant sums for undirected Hamiltonicity, 173 Björklund, 2008, Exact algorithms for exact satisfiability and number of perfect matchings, Algorithmica, 52, 226, 10.1007/s00453-007-9149-8 Björklund Bourgeois, 2009, Efficient approximation of min set cover by moderately exponential algorithms, Theoretical Computer Science, 410, 2184, 10.1016/j.tcs.2009.02.007 Bourgeois, 2009, Efficient approximation of min coloring by moderately exponential algorithms, Information Processing Letters, 109, 950, 10.1016/j.ipl.2009.05.002 Bourgeois, 2011, Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Discrete Applied Mathematics, 159, 1954, 10.1016/j.dam.2011.07.009 Byrka, 2010, An improved LP-based approximation for Steiner tree, 583 Cai, 2006, Fixed-parameter approximation: conceptual framework and approximability results, vol. 4169, 96 Christofides, 1976 Cygan, 2012, On problems as hard as CNF-SAT, 74 Cygan Cygan, 2009, Exponential-time approximation of weighted set cover, Information Processing Letters, 109, 957, 10.1016/j.ipl.2009.05.003 Cygan, 2010, Exact and approximate bandwidth, Theoretical Computer Science, 411, 3701, 10.1016/j.tcs.2010.06.018 Downey, 2006, Parameterized approximation problems, vol. 4169, 121 Downey, 2008, Parameterized approximation of dominating set problems, Information Processing Letters, 109, 68, 10.1016/j.ipl.2008.09.017 Escoffier, 2012 Fomin, 2008, Faster Steiner tree computation in polynomial-space, vol. 5193, 430 Fürer, 2009, An exponential time 2-approximation algorithm for bandwidth, vol. 5917, 173 Gurevich, 1987, Expected computation time for Hamiltonian path problem, SIAM Journal on Computing, 16, 486, 10.1137/0216034 Held, 1962, A dynamic programming approach to sequencing problems, SIAM Journal, 10, 196 Impagliazzo, 2001, Which problems have strongly exponential complexity?, Journal of Computer and Systems Sciences, 63, 512, 10.1006/jcss.2001.1774 Kaplan, 2005, Approximation algorithms for asymmetric tsp by decomposing directed regular multigraphs, Journal of the ACM, 52, 602, 10.1145/1082036.1082041 Kowalik, 2008, Deterministic 7/8-approximation for the metric maximum TSP, vol. 5171, 132 Lokshtanov, 2010, Saving space by algebraization, 321 Mölle, 2006, A faster algorithm for the Steiner tree problem, vol. 3884, 561 Monnot, 2005, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), European Journal of Operational Research, 161, 721, 10.1016/j.ejor.2003.09.007 Moshkovitz, 2008, Two query PCP with sub-constant error, 314 Nederlof, 2009, Fast polynomial-space algorithms using Möbius inversion: improving on Steiner tree and related problems, vol. 5555, 713 Paluch, 2009, A 7/9-approximation algorithm for the maximum traveling salesman problem, vol. 5687, 298 Papadimitriou, 1993, The traveling salesman problem with distances one and two, Mathematics of Operations Research, 18, 1, 10.1287/moor.18.1.1 Sebö