Open AccessNearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization
Author(s) -
Alan Kuhnle
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.v35i9.16998
Subject(s) - parallelizable manifold , submodular set function , cardinality (data modeling) , multilinear map , algorithm , monotone polygon , heuristic , maximization , mathematics , constraint (computer aided design) , logarithm , set (abstract data type) , mathematical optimization , computer science , mathematical analysis , geometry , pure mathematics , data mining , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom