"The Complexity of Finding Fair Many-to-One Matchings."

Niclas Boehmer, Tomohiro Koana (2024)

> Home

Details and statistics

DOI: 10.1145/3649220

access: closed

type: Journal Article

metadata version: 2024-07-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/BoehmerK24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/BoehmerK24
Niclas Boehmer, Tomohiro Koana:
The Complexity of Finding Fair Many-to-One Matchings. ACM Trans. Algorithms 20(2): 17 (2024)

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.