"The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial ..."

Julien Lesca, Michel Minoux, Patrice Perny (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0434-5

access: closed

type: Journal Article

metadata version: 2019-01-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/LescaMP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/LescaMP19
Julien Lesca, Michel Minoux, Patrice Perny:
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases. Algorithmica 81(1): 98-123 (2019)

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.