z-logo
open-access-imgOpen Access
Accelerated Best-First Search With Upper-Bound Computation for Submodular Function Maximization
Author(s) -
Shinsaku Sakaue,
Masakazu Ishihata
Publication year - 2018
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.v32i1.11521
Subject(s) - submodular set function , knapsack problem , maximization , mathematical optimization , greedy algorithm , monotone polygon , constraint (computer aided design) , computation , heuristic , upper and lower bounds , function (biology) , computer science , mathematics , algorithm , mathematical analysis , geometry , evolutionary biology , biology

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