z-logo
open-access-imgOpen Access
Minimum Robust Multi-Submodular Cover for Fairness
Author(s) -
Lan N. Nguyen,
My T. Thai
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i10.17100
Subject(s) - submodular set function , cover (algebra) , heuristics , monotone polygon , set cover problem , set (abstract data type) , mathematics , combinatorics , integer (computer science) , approximation algorithm , discrete mathematics , computer science , mathematical optimization , algorithm , mechanical engineering , geometry , engineering , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom