On the complexity of cake cutting

From MaRDI portal
Publication:2467132

DOI10.1016/J.DISOPT.2006.07.003zbMATH Open1163.91447OpenAlexW1975079208MaRDI QIDQ2467132FDOQ2467132

JiΕ™Γ­ Sgall, Gerhard J. Woeginger

Publication date: 18 January 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.07.003





Cites Work


Cited In (18)


   Recommendations





This page was built for publication: On the complexity of cake cutting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467132)