The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity.

Christina Boucher

Browse the full MFCS paper archive.