Results 11 to 20 of about 1,909,109 (209)
Multi-Agent Submodular Optimization [PDF]
CoRR, 2018 Recent years have seen many algorithmic advances in the area of submodular optimization: (SO) min/max~f(S): S in F, where F is a given family of feasible sets over a ground set V and f:2^V - > R is submodular. This progress has been coupled with a wealth
Shepherd, F. Bruce, Santiago, Richard
core +7 more sources
Online Dynamic Submodular Optimization [PDF]
AutomaticaWe propose new algorithms with provable performance for online binary optimization subject to general constraints and in dynamic settings. We consider the subset of problems in which the objective function is submodular.
Lesage-Landry, Antoine, Pallage, Julien
core +6 more sources
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
CoRR, 2013 We investigate two new optimization problems — minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack ...
Rishabh Iyer, Jeff Bilmes
core +5 more sources
Submodular Optimization with Routing Constraints
Proceedings of the AAAI Conference on Artificial Intelligence, 2016 Submodular optimization, particularly under cardinality or cost constraints, has received considerable attention, stemming from its breadth of application, ranging from sensor placement to targeted marketing.
Zhang, Haifeng +3 more
core +3 more sources
Migration as Submodular Optimization
Proceedings of the AAAI Conference on Artificial Intelligence, 2019 Migration presents sweeping societal challenges that have recently attracted significant attention from the scientific community. One of the prominent approaches that have been suggested employs optimization and machine learning to match migrants to ...
Procaccia, Ariel D., Gölz, Paul
core +6 more sources
Submodular functions and optimization
, 2005 It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing ...
Fujishige, Satoru
core +2 more sources
Submodular Optimization Under Uncertainty
, 2023 Submodular functions, which are a natural discrete analog of convex/concave functions, strike a sweet spot between generality and structure: they model an immense variety of applications in computer science and beyond, but, at the same time, are ...
Roie Levin (4935838)
core +2 more sources
Submodular Dominance and Applications [PDF]
, 2022 In submodular optimization we often deal with the expected value of a submodular function $f$ on a distribution $\mathcal{D}$ over sets of elements. In this work we study such submodular expectations for negatively dependent distributions. We introduce a
Singla, Sahil, Qiu, Frederick
core +2 more sources
Submodlib: A Submodular Optimization Library
CoRR, 2022 23 pages with references, 10 figures, 5 ...
Vishal Kaushal +2 more
openaire +2 more sources
Approximating (mB,mP)-Monotone BP Maximization and Extensions
Tsinghua Science and Technology, 2023 The paper proposes the optimization problem of maximizing the sum of suBmodular and suPermodular (BP) functions with partial monotonicity under a streaming fashion.
Ruiqi Yang +4 more
doaj +1 more source