On the limitations of deterministic de-randomizations for online bipartite matching and max-sat.

Nicolas Pena Allan Borodin

Published in: CoRR (2016)

Keyphrases

max sat
bipartite matching
weighted max sat
branch and bound algorithm
sat solvers
search algorithm
lower bound
satisfiability problem
tabu search
maximum weight
sat problem
max sat solver
phase transition
minimum cost flow
branch and bound
boolean satisfiability
linear programming
maximum satisfiability