Branch-and-reduce exponential/FPT algorithms in practice

    Theoretical Computer Science, pp. 211-225, 2016.

    Cited by: 45|Bibtex|Views0|

    Abstract:

    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 empirical efficiency of such theoretical alg...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments