Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (2020)
Attributed to:
Investigating problems in the complexity class TFNP
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1609/aaai.v34i02.5570
Publication URI: http://dx.doi.org/10.1609/aaai.v34i02.5570
Type: Journal Article/Review
Parent Publication: Proceedings of the AAAI Conference on Artificial Intelligence
Issue: 02