z-logo
open-access-imgOpen Access
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee
Author(s) -
Chao Feng,
Chao Qian
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i14.17460
Subject(s) - submodular set function , maximization , mathematics , combinatorics , regret , polytope , bounded function , mathematical optimization , set (abstract data type) , function (biology) , pareto principle , minification , discrete mathematics , computer science , statistics , mathematical analysis , evolutionary biology , biology , 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