📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

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: https://api.elsevier.com/content/abstract/scopus_id/85137892430

Type: Other

Parent Publication: IJCAI International Joint Conference on Artificial Intelligence

ISSN: 10450823