Search Results for author:
Found 2 papers, 0 papers with code
Online 2-stage Stable Matching
There is a first round where some students apply, and a first (stable) matching $M_1$ has to be computed.
Online learning for min-max discrete problems
We show that for different nonlinear discrete optimization problems, it is strongly $NP$-hard to solve the offline optimization oracle, even for problems that can be solved in polynomial time in the static case (e. g. min-max vertex cover, min-max perfect matching, etc.).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
