Enumeration Algorithms
Andrea Marino · Atlantis studies in computing · 2015
In this chapter we present an overview of the main issues related to enumeration problems and the main techniques to design algorithms and proving their complexity. Among these, we will discuss brute force approaches and basic paradigms, like backtracking, binary partition, and reverse search. Moreover, amortized analysis will be introduced by discussing basic amortization, amortization by children, and push out amortization. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.