… But what can we say about finding exact solutions … In what follows, we do not try to give
a comprehensive survey of exact exponential algorithms. Indeed, even listing the most …

… We present an exponential algorithm solving the problem by dynamic programming. For
every nonempty subset S ⊆ X, and for every j = 1, 2,...,k we define F[S; j] as the minimum …

… The main point is that a reasonable amount of exponentiality is the price we have to pay to
obtain exact solutions to combinatorial hard problems, unless P = NP. In the literature, many …

… exact algorithms for algorithms that find exact solutions of NP-hard problem (and thus run in
exponential … [61] for an introduction to exponential time algorithms. In this paper we review …

… to the field of exact exponential-time algorithms. Chapter 2 introduces a series of common
algorithmic techniques in the field of exact exponential-time algorithms that will be used …

… first non-trivial exact algorithms for these problems. In particular, we obtain an O∗((1.89)n)
time exact algorithm for k-median that works for any value of k. Our algorithm is quite general …

… The main point is that a reasonable amount of exponentiality is the price we have to pay to
obtain exact solutions to combinatorial hard problems, unless P = NP. In the literature, many …

… This is a task which is usually performed for polynomially solvable problems: when we provide
an exact polynomial-time algorithm we usually also provide information about the number …

… efficient exact algorithms for the Max Cut problem in graphs with average vertex degree 3
and 4 and for the 3-Hitting Set problem; these are not the best known exact algorithms for …

… This paper provides a moderately exact exponential algorithm which can be applied to …
are considered as hard, ie, no polynomial time algorithm is likely to exist for finding the optimal …