"Exploring Algorithmic Fairness in Robust Graph Covering Problems."

Aida Rahmattalabi et al. (2019)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-01-21

- view
  - electronic edition @ neurips.cc (open access)
  - electronic edition @ nips.cc (open access)
- export record
  dblp key:
  - conf/nips/RahmattalabiVFR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/RahmattalabiVFR19
Aida Rahmattalabi, Phebe Vayanos, Anthony Fulginiti, Eric Rice, Bryan Wilder, Amulya Yadav, Milind Tambe:
Exploring Algorithmic Fairness in Robust Graph Covering Problems. NeurIPS 2019: 15750-15761

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.