Výsledky vyhledávání - "continuous greedy algorithm"

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice: Continuous Greedy Algorithm on Median Complex Autor Maehara, Takanori, Nakashima, So, Yamaguchi, Yutaro

“… )-approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices…”
Získat plný text

An accelerated continuous greedy algorithm for maximizing strong submodular functions Autor Wang, Zengfu, Moran, Bill, Wang, Xuezhi, Pan, Quan

“…An accelerated continuous greedy algorithm is proposed for maximization of a special class of non-decreasing submodular functions f : 2 X → R…”
Získat plný text

A Unified Continuous Greedy Algorithm for Submodular Maximization Autor Feldman, Moran, Naor, Joseph, Schwartz, Roy

“…The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the…”
Získat plný text

Parametric monotone function maximization with matroid constraints Autor Gong, Suning, Nong, Qingqin, Liu, Wenjing, Fang, Qizhi

“… Gruia Calinescu, Chandra Chekuri, Martin Pál and Jan Vondrák have shown that, if f is nondecreasing and submodular, the continuous greedy algorithm and pipage…”
Získat plný text

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Autor Filmus, Yuval, Ward, Justin

“… Compared to the continuous greedy algorithm [G. Calinescu et al., IPCO, Springer, Berlin, 2007, pp. 182--196…”
Získat plný text

Beyond submodular maximization via one-sided smoothness Autor Ghadiri, Mehrdad, Santiago, Richard, Shepherd, Bruce

“…$$ 1 - 1 / e approximation for maximizing a monotone submodular function subject to a matroid constraint, including as special case the submodular welfare problem…”
Získat plný text

Fast algorithms for maximizing monotone nonsubmodular functions Autor Liu, Bin, Hu, Miaomiao

“… ( n ϵ l o g n ϵ ) queries to the function value oracle. The second result is a new variant of the continuous greedy algorithm for a matroid constraint…”
Získat plný text

Maximizing a deep submodular function optimization with a weighted MAX-SAT problem for trajectory clustering and motion segmentation Autor Chandriah, Kiran Kumar, Naraganahalli, Raghavendra V

“… This paper proposes a joint framework for maximizing submodular energy subject to a matroid constraint using Deep Submodular Function (DSF…”
Získat plný text

Learning and Optimizing Set Functions Autor Özcan, Gözde

“… For problems of this nature, the continuous greedy algorithm by Calinescu…”
Získat plný text

Constrained Submodular Maximization: Beyond 1/e Autor Ene, Alina, Nguyen, Huy L.

“… The approximation guarantee is 0.372 and it is the first improvement over the 1/e approximation achieved by the unified Continuous Greedy algorithm [Feldman et al., FOCS 2011]…”
Získat plný text

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Autor Filmus, Y., Ward, J.

“… Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pal and Vondrak, 2008), our algorithm is extremely simple and requires no rounding…”
Získat plný text

Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions Autor Bai, Wenruo, Noble, William S, Bilmes, Jeff A

“…We study the problem of maximizing deep submodular functions (DSFs) [13, 3] subject to a matroid constraint…”
Zjistit podrobnosti o přístupu

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Autor Filmus, Yuval, Ward, Justin

“… Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pal and Vondrak, 2008), our algorithm is extremely simple and requires no rounding…”
Získat plný text

Fast Non-Monotone Submodular Maximisation Subject to a Matroid Constraint Autor Segui-Gasco, Pau, Shin, Hyo-Sang

“…) with a smoother version of the measured continuous greedy algorithm of Feldman et al. (FOCS 2011). This enables us to obtain an algorithm that requires…”
Získat plný text

Oblivious and Non-Oblivious Local Search for Combinatorial Optimization Autor Ward, Justin

“… of constrained linear and monotone submodular maximization. First, we give a new, randomized approximation algorithm for maximizing a monotone submodular function subject to a matroid constraint…”
Získat plný text

Parallel algorithms for maximizing one-sided \(\sigma\)-smooth function Autor Zhang, Hongxiang, Cheng, Yukun, Wu, Chenchen, Xu, Dachuan, Du, Dingzhu

“… Different with the serial algorithm with name Jump-Start Continuous Greedy Algorithm by Mehrdad et al. \cite{GSS2021…”
Získat plný text

Regularized Non-monotone Submodular Maximization Autor Cheng, Lu, Yang, Wenguo, Gao, Suixiang

“…In this paper, we present a thorough study of maximizing a regularized non-monotone submodular function subject to various constraints, i.e., \(\max \{ g(A) - \ell(A) : A \in \mathcal{F} \}\), where \(g \colon 2^\Omega \to \mathbb{R…”
Získat plný text

Constrained Submodular Maximization: Beyond 1/e Autor Ene, Alina, Nguyen, Huy L

“… The approximation guarantee is 0.372 and it is the first improvement over the 1/e approximation achieved by the unified Continuous Greedy algorithm [Feldman et al., FOCS 2011]…”
Získat plný text

Optimal approximation for submodular and supermodular optimization with bounded curvature Autor Sviridenko, Maxim, Vondrák, Jan, Ward, Justin

“…We design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint…”
Získat plný text

Dependent Randomized Rounding for Matroid Polytopes and Applications Autor Chekuri, Chandra, Vondrak, Jan, Zenklusen, Rico

“…Motivated by several applications, we consider the problem of randomly rounding a fractional solution in a matroid (base) polytope to an integral one. We…”
Získat plný text