The Complexity of Envy-Free Graph Cutting

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
January 2022
PDF bib Project Project DOI

Abstract

Full Citation:

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak. The Complexity of Envy-Free Graph Cutting. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt), pages 237-243, 2022, ijcai.org.

Type
Conference Paper
ParAI Nfpc
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.