Results 21 to 30 of about 12,182 (176)

Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties

open access: yesMathematics, 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

An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty

open access: yesComputation, 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

SFExt-PGAbs: Two-Stage Summarization Model for Long Document

open access: yesJisuanji 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

Submodular partition functions

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amini, Omid   +3 more
openaire   +3 more sources

Distributed Maximization of Submodular and Approximately Submodular Functions [PDF]

open access: yes2020 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 ...
Ye, Lintao, Sundaram, Shreyas
openaire   +2 more sources

New Query Lower Bounds for Submodular Function Minimization [PDF]

open access: yes, 2019
We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\rightarrow \mathbb{R}$, find an element of $\arg\min_S \{f(S)\}$ using as few queries to $f(\cdot)$ as possible. State-of-the-
Graur, Andrei   +3 more
core   +2 more sources

Quantitative approximation by nonlinear Angheluta-Choquet singular integrals

open access: yesJournal of Numerical Analysis and Approximation Theory, 2020
By using the concept of nonlinear Choquet integral with respect to a capacity and as a generalization of the Poisson-Cauchy-Choquet operators, we introduce the nonlinear Angheluta-Choquet singular integrals with respect to a family of submodular set ...
Sorin Gal, Ionut Iancu
doaj   +7 more sources

A new matroid constructed by the rank function of a matroid

open access: yesAKCE 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

Toward Optimal Placement of Spatial Sensors to Detect Poisson-Distributed Targets

open access: yesIEEE Access, 2023
This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.
Mingyu Kim   +5 more
doaj   +1 more source

Continuous submodular function maximization

open access: yes, 2020
Continuous submodular functions are a category of generally non-convex/non-concave functions with a wide spectrum of applications. The celebrated property of this class of functions - continuous submodularity - enables both exact minimization and approximate maximization in poly. time.
Bian, Yatao; id_orcid0000-0002-2368-4084   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy