Results 141 to 150 of about 5,397,625 (216)

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

A Polynomial Algorithm for Minimizing $k$-Distant Submodular Functions [PDF]

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at least $k$.
Mizutani, Ryuhei
core  

Analyzing greedy vaccine allocation algorithms for metapopulation disease models. [PDF]

PLoS Comput Biol
Keithley J, Choudhuri A, Adhikari B, Pemmaraju SV.   +3 more
europepmc   +1 more source

Semi-streaming algorithms for submodular matroid intersection. [PDF]

Math Program, 2023
Garg P, Jordan L, Svensson O.
europepmc   +1 more source

GA-AFedOD: gradient-aligned active federated learning for resource-aware object detection in edge industrial IoT. [PDF]

Front Artif Intell
Wang Z, Yuan X, Chen J.
europepmc   +1 more source

Infodemic Source Detection with Information Flow: Foundations and Scalable Computation. [PDF]

Entropy (Basel)
Wang Z, Zhao C, Zhou Q, Tan CW, Chan C.
europepmc   +1 more source

Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]

Entropy (Basel), 2022
Sason I.
europepmc   +1 more source

Identifying representative sequences of protein families using submodular optimization. [PDF]

Sci Rep
Nguyen H, Nguyen H, Nguyen P, Luu AN, Cantu DC, Nguyen T.   +5 more
europepmc   +1 more source

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. [PDF]

Algorithmica
Ezra T, Leonardi S, Pawłowski M, Russo M, Umboh SW.   +4 more
europepmc   +1 more source

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

Theory Comput Syst
van Heuven van Staereling I, de Keijzer B, Schäfer G.   +2 more
europepmc   +1 more source