Results 11 to 20 of about 9,676,389 (199)
Monotonic Decompositions of Submodular Set Functions [PDF]
SIAM Journal on Discrete Mathematics26 ...
Kristóf Bérczi +4 more
core +8 more sources
Balanced sets in an independence structure induced by a submodular function [PDF]
Journal of Mathematical Analysis and Applications, 1983 AbstractA submodular (and non-decreasing) function on a set induces an independence structure; the notion of a “balanced” set in this situation helps us determine whether a given independence structure is induced by any submodular function other than its own rank function, answering a question of U. S. R. Murty and I. Simon.
Jeremy E Dawson, Dawson, Jeremy E
openaire +2 more sources
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
Computation, 2022 In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty function π:2U→R+ on the plane, the relationship that adjusts the power p(s) of each sensor s and its ...
Han Dai
doaj +1 more source
International Journal of Distributed Sensor Networks, 2021 In this article, we consider the problem of optimally selecting a subset of transmitters from a transmitter set available to a multiple-input and multiple-output radar network.
Chenggang Wang +3 more
doaj +1 more source
Constrained Path Search with Submodular Function Maximization [PDF]
, 2022 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
Fast and exact search for the partition with minimal information loss. [PDF]
PLoS ONE, 2018 In analysis of multi-component complex systems, such as neural systems, identifying groups of units that share similar functionality will aid understanding of the underlying structures of the system.
Shohei Hidaka, Masafumi Oizumi
doaj +1 more source
Single Machine Vector Scheduling with General Penalties
Mathematics, 2021 In this paper, we study the single machine vector scheduling problem (SMVS) with general penalties, in which each job is characterized by a d-dimensional vector and can be accepted and processed on the machine or rejected.
Xiaofei Liu, Weidong Li, Yaoyu Zhu
doaj +1 more source
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
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Vondrák, Jan, Ene, Alina
core +1 more source
IEEE Access, 2018 Submodular optimization plays a significant role in combinatorial problems, since it captures the structure of the edge cuts in graphs, the coverage of sets, and so on. Many data mining and machine learning problems can be cast as submodular maximization
Qilian Yu, Li Xu, Shuguang Cui
doaj +1 more source