Results 141 to 150 of about 5,146,266 (215)

Which submodular functions are expressible using binary submodular functions?

open access: yes, 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

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

open access: yesTheory Comput Syst
van Heuven van Staereling I   +2 more
europepmc   +1 more source

Probing transcription factor subsets in gene regulatory networks. [PDF]

open access: yesAlgorithms Mol Biol
Geis L   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy