"The Complexity of Envy-Free Graph Cutting."

Argyrios Deligkas et al. (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2312.07043

access: open

type: Informal or Other Publication

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2312-07043
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2312-07043
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. CoRR abs/2312.07043 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.