"The Complexity of Envy-Free Graph Cutting."

Argyrios Deligkas et al. (2023)

Details and statistics

DOI: 10.48550/ARXIV.2312.07043

access: open

type: Informal or Other Publication

metadata version: 2024-01-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics