Results 111 to 120 of about 13,098 (239)
Which submodular functions are expressible using binary submodular functions?
, 2016 Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been devised to minimise such functions. The time complexity of the fastest known general algorithm for submodular function minimisation (SFM) is O(n^6+n^5L), where n is the number of variables and L is the time required to evaluate ...
Živný, S, Jeavons, P
openaire +2 more sources
Multi-Objective Maximization of Monotone Submodular Functions with\n Cardinality Constraint [PDF]
, 2017 Rajan Udwani
openalex +1 more source
Learning and Optimization with Submodular Functions [PDF]
, 2015 Bharath Sankaran +4 more
openalex +1 more source
Exploiting submodular value functions for scaling up active perception [PDF]
, 2017 Yash Satsangi +3 more
openalex +1 more source
An Exact Method for Constrained Maximization of the Conditional Value-at-Risk of a Class of Stochastic Submodular Functions [PDF]
, 2019 Hao-Hsiang Wu, Si̇mge Küçükyavuz
openalex +1 more source
Comments on the proof of adaptive submodular function minimization [PDF]
, 2017 Nan Feng, Venkatesh Saligrama
openalex +1 more source
AN EFFICIENT BRANCH-AND-CUT ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION
, 2020 Naoya Uematsu +2 more
openalex +2 more sources
Optimal Bounds on Approximation of Submodular and XOS Functions by\n Juntas [PDF]
, 2013 Vitaly Feldman, Jan Vondrák
openalex +1 more source
On the Reducibility of Submodular Functions [PDF]
, 2016 Jincheng Mei, Hao Zhang, Bao‐Liang Lu
openalex +1 more source