Results 31 to 40 of about 5,397,625 (216)
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
Reconfiguration Problems on Submodular Functions [PDF]
Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, 2022 Reconfiguration problems require finding a step-by-step transformation between a pair of feasible solutions for a particular problem. The primary concern in Theoretical Computer Science has been revealing their computational complexity for classical problems.
Naoto Ohsaka, Tatsuya Matsuoka
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
Journal of Mathematics, 2023 In this paper, we focus on solving the vector scheduling problem with submodular penalties on parallel machines. We are given n jobs and m parallel machines, where each job is associated with a d-dimensional vector.
Bihui Cheng, Wencheng Wang
doaj +1 more source
SFExt-PGAbs: Two-Stage Summarization Model for Long Document
Jisuanji kexue yu tansuo, 2021 Aiming at the fluency problem of extractive method, the accuracy problem of abstractive method, and the important information missing problem caused by truncating the original document before document encoding, this paper proposes a two-stage long ...
ZHOU Weixiao, LAN Wenfei, XU Zhiming, ZHU Rongbo
doaj +1 more source
A new matroid constructed by the rank function of a matroid
AKCE International Journal of Graphs and Combinatorics, 2020 In this article, we construct a submodular function using the rank function of a matroid and study induced matroid with constructed polymatroid, then we relate some properties of connectivity of new matroid with the main matroid.
Moein Pourbaba +2 more
doaj +1 more source
CoRR, 2014 Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions, which we call {\em weakly submodular functions}. Our extension includes some (mildly) supermodular functions.
Allan Borodin, Dai Le, Yuli Ye
openaire +3 more sources
Balanced Submodular Flows [PDF]
, 2023 This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edges. A min-max formula is given to the problem and an algorithm is presented
Szabó, Eszter, Jüttner, Alpár
core
Mobility-Aware Traffic Offloading via Cooperative Coded Edge Caching
IEEE Access, 2020 With caching popular contents at the small-cell base stations (SBSs), cooperative edge caching has emerged as an effective approach to offload explosively increasing network traffic from a massive number of users in mobile edge networks (MENs).
Dewang Ren +3 more
doaj +1 more source
On the Reducibility of Submodular Functions
CoRR, 2016 The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that enables us to reduce the solution space of submodular optimization problems without performance loss. We introduce the concept of reducibility using marginal gains.
Jincheng Mei, Hao Zhang, Bao-Liang Lu
openaire +4 more sources