Results 31 to 40 of about 2,699,353 (198)
Distributed Maximization of Submodular and Approximately Submodular Functions [PDF]
2020 59th IEEE Conference on Decision and Control (CDC), 2020 We study the problem of maximizing a submodular function, subject to a cardinality constraint, with a set of agents communicating over a connected graph. We propose a distributed greedy algorithm that allows all the agents to converge to a near-optimal solution to the global maximization problem using only local information and communication with ...
Lintao Ye, Shreyas Sundaram
openaire +3 more sources
Approximating Special Social Influence Maximization Problems
Tsinghua Science and Technology, 2020 Social Influence Maximization Problems (SIMPs) deal with selecting k seeds in a given Online Social Network (OSN) to maximize the number of eventually-influenced users.
Jie Wu, Ning Wang
doaj +1 more source
A Note on Maximizing Regularized Submodular Functions Under Streaming
Tsinghua Science and Technology, 2023 Recent progress in maximizing submodular functions with a cardinality constraint through centralized and streaming modes has demonstrated a wide range of applications and also developed comprehensive theoretical guarantees.
Qinqin Gong +3 more
doaj +1 more source
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
Mathematics, 2020 In this paper, we study the submodular load balancing problem with submodular penalties. The objective of this problem is to balance the load among sets, while some elements can be rejected by paying some penalties. Officially, given an element set V, we
Xiaofei Liu, Peiyin Xing, Weidong Li
doaj +1 more source
A sample decreasing threshold greedy-based algorithm for big data summarisation
Journal of Big Data, 2021 As the scale of datasets used for big data applications expands rapidly, there have been increased efforts to develop faster algorithms. This paper addresses big data summarisation problems using the submodular maximisation approach and proposes an ...
Teng Li +2 more
doaj +1 more source
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
Convex Analysis for Minimizing and Learning Submodular Set Functions [PDF]
, 2013 The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions. First, we develop a novel method for minimizing a particular class of submodular functions, which can be expressed as a
Peter Stobbe, Stobbe, Peter
core +1 more source
Submodular partition functions
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amini, Omid +3 more
openaire +3 more sources
Subquadratic submodular function minimization [PDF]
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017 Submodular function minimization (SFM) is a fundamental discrete optimization problem which generalizes many well known problems, has applications in various fields, and can be solved in polynomial time. Owing to applications in computer vision and machine learning, fast SFM algorithms are highly desirable. The current fastest algorithms [Lee, Sidford,
Deeparnab Chakrabarty +3 more
openaire +2 more sources
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search [PDF]
, 2013 We present an optimal, combinatorial 1−1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pál and Vondrák, 2008), our algorithm is extremely simple ...
Filmus, Yuval +3 more
core +1 more source