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.1613/jair.1.12222
Publication URI: http://dx.doi.org/10.1613/jair.1.12222
Type: Journal Article/Review
Parent Publication: Journal of Artificial Intelligence Research