1 paper · 1 filter
Samuel Bismuth, Erel Segal-Halevi
We present an approximation notion for NP-hard optimization problems. The notion is based on an amortized relaxation: the relaxed optimum of an input is the largest per-copy value…