The Complexity of Envy-Free Graph Cutting (2022)

First Author: Deligkas A
Attributed to:  Next Generation of Algorithms for Mixed Integer Linear Programming (MILP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.24963/ijcai.2022/34

Publication URI: http://dx.doi.org/10.24963/ijcai.2022/34

Type: Conference/Paper/Proceeding/Abstract