Results 21 to 30 of about 5,146,266 (215)
k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints
A k-submodular function is a generalization of a submodular function, its definition domain is extended from the collection of single subsets to the collection of k disjoint subsets. The k-submodular maximization problem has a wide range of applications.
Qian Liu, Kemin Yu, Min Li, Yang Zhou
doaj +1 more source
Submodular function minimization and polarity [PDF]
Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lovász extension. The polar approach provides an alternative proof for the convex hull description of the epigraph of a submodular function ...
Alper Atamtürk, Vishnu Narayanan
openaire +4 more sources
Regularized Submodular Maximization With a
With the development of the Internet and the emergence of various social-media platforms, designing approximation algorithms for optimization problems such as the influence maximization in social networks has received widespread attention.
Qingqin Nong, Zhijia Guo, Suning Gong
doaj +1 more source
Learning submodular functions [PDF]
There has been much interest in the machine learning and algorithmic game theory communities on understanding and using submodular functions. Despite this substantial interest, little is known about their learnability from data. Motivated by applications, such as pricing goods in economics, this paper considers PAC-style learning of submodular ...
Balcan, Maria-Florina +1 more
openaire +2 more sources
Misinformation Correction Maximization Problem with Edge Addition in Social Networks [PDF]
The popularity of online social networks such as Wechat has aroused people’s more attention to information diffusion.The spread of misinformation in social networks may lead to serious consequences,such as economic losses and public panic.Therefore ...
SONG Xin-yue, SHUAI Tian-ping, CHEN Bin
doaj +1 more source
Constrained Path Search with Submodular Function Maximization [PDF]
In this paper, we study the problem of constrained path search with submodular function maximization (CPS-SM). We aim to find the path with the best submodular function score under a given constraint (e.g., a length limit), where the submodular function ...
Fang, Yixiang +6 more
core +1 more source
Some Results about the Contractions and the Pendant Pairs of a Submodular System [PDF]
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory ...
Saeid Hanifehnezhad, Ardeshir Dolati
doaj +1 more source
Branch and price for submodular bin packing
The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular.
Liding Xu +3 more
doaj +1 more source
Distributed Maximization of Submodular and Approximately Submodular Functions [PDF]
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
Fast Submodular Function Maximization [PDF]
Submodular functions have many real-world applications, such as document summarization, sensor placement, and image segmentation. For all these applications, the key building block is how to compute the maximum value of a submodular function efficiently.
Song, Zhao, Wang, Yitan, Qin, Lianke
core +1 more source

