Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover

• Published in: Theoretical computer science Vol. 609; pp. 211 - 225
• Main Authors: Akiba, Takuya, Iwata, Yoichi
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 04.01.2016
• Subjects: Algorithms; Branch-and-reduce; Complexity; Empirical analysis; Exact exponential algorithms; FPT algorithms; Reduction; State of the art; Vertex cover; Vertex cover; Exact exponential algorithms; Branch-and-reduce; FPT algorithms

We investigate the gap between theory and practice for exact branching algorithms. In theory, branch-and-reduce algorithms currently have the best time complexity for numerous important problems. On the other hand, in practice, state-of-the-art methods are based on different approaches, and the empi...