An approximation scheme for cake division with a linear number of cuts

DOI10.1007/3-540-45749-6_77MaRDI QIDQ4411420zbMATH OpenFDO

Authors Gerhard J. Woeginger

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610896.htm

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial games (91A46)

Recommendations

• An approximation scheme for cake division with a linear number of cuts
• Scientific article; zbMATH DE number 2119670
• On the complexity of cake cutting
• Approximating fair division with a limited number of cuts
• How to cut a cake fairly using a minimal number of cuts

Cited in

(9)

• How to cut a cake fairly using a minimal number of cuts
• Approximating fair division with a limited number of cuts
• An approximation scheme for cake division with a linear number of cuts
• A Note on a Cake Cutting Algorithm of Banach and Knaster
• scientific article; zbMATH DE number 2119670 (Why is no real title available?)
• On a method of obtaining an approximate solution of an exact fair division problem
• Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
• Constant factor approximation for balanced cut in the PIE model
• How to solve the cake-cutting problem in sublinear time

This page was built for publication: An approximation scheme for cake division with a linear number of cuts

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