Reviews: Min-Max Propagation

POST-REBUTTAL UPDATE I have read and considered the authors' response and stand by my initial decision. I would heavily stress that the revised paper more clearly state prior work on message passing specific to the min-max semiring, including Aji and McEliece and Vinyals et al. SUMMARY: The authors propose a dynamic programming algorithm for solving min-max problems with objectives that decompose as a set of lower dimensional factors. For cases where factors have high arity the authors further show an efficient updating scheme in cases where factors can be efficiently minimized with some variables clamped. Further speedups are shown for cases where the domain is constrained to a feasible subset. PROS: This reviewer found the paper to be well-rounded with a clear presentation of algorithmic components and with experiments on an interesting load balancing application.