Suchergebnisse - "continuous greedy algorithm"

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

“… )-approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices …”
Volltext

An accelerated continuous greedy algorithm for maximizing strong submodular functions von 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 …”
Volltext

A Unified Continuous Greedy Algorithm for Submodular Maximization von 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 …”
Volltext

Regularized nonmonotone submodular maximization von Lu, Cheng, Yang, Wenguo, Gao, Suixiang

“… In this paper, we present a thorough study of the regularized submodular maximization problem, in which the objective $ f:=g-\ell $ f := g − ℓ can be expressed …”
Volltext

A unified continuous greedy algorithm for \(k\)-submodular maximization under a down-monotone constraint von Zhang, Hongyang, Luo, Wenchang

“… \) topics, and feature selection with \(k\) partitions. In this paper, we provide a unified continuous greedy algorithm for \(k …”
Volltext

Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex von Maehara, Takanori, Nakashima, So, Yamaguchi, Yutaro

“… \) approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices …”
Volltext

Parametric monotone function maximization with matroid constraints von 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 …”
Volltext

Continuous Influence-Based Community Partition for Social Networks von Ni, Qiufen, Guo, Jianxiong, Wu, Weili, Wang, Huan, Wu, Jigang

“… Community partition is of great importance in social networks because of the rapid increasing network scale, data and applications. We consider the community …”
Volltext

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

“… Compared to the continuous greedy algorithm [G. Calinescu et al., IPCO, Springer, Berlin, 2007, pp. 182--196 …”
Volltext

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice von Maehara, Takanori, Nakashima, So, Yamaguchi, Yutaro

“… ])-approximation algorithm for this problem. To achieve this result, we generalize the continuous greedy algorithm to distributive lattices …”
Volltext

Influence-Based Community Partition With Sandwich Method for Social Networks von Ni, Qiufen, Guo, Jianxiong, Wu, Weili, Wang, Huan

“… Community partition is an important problem in many areas, such as biology networks and social networks. The objective of this problem is to analyze the …”
Volltext

Kelly Cache Networks von Mahdian, Milad, Moharrer, Armin, Ioannidis, Stratis, Yeh, Edmund

“… maximization problem. We show that so-called continuous greedy algorithm attains a ratio arbitrarily close to <inline …”
Volltext

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

“… The multilinear framework for submodular maximization was developed to achieve a tight $$1-1/e$$ 1 - 1 / e approximation for maximizing a monotone submodular …”
Volltext

Fast algorithms for maximizing monotone nonsubmodular functions von 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 …”
Volltext

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

“… Computer vision models are commonly defined for maximum constrained submodular functions lies at the core of low-level and high-level models. In such that, the …”
Volltext

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

“… For problems of this nature, the continuous greedy algorithm by Calinescu …”
Volltext

Kelly Cache Networks von Mahdian, Milad, Moharrer, Armin, Ioannidis, Stratis, Yeh, Edmund

“… maximization problem. We show that so-called continuous greedy algorithm [1] attains a ratio arbitrarily close to 1-1/ e\approx …”
Volltext

Continuous Influence-based Community Partition for Social Networks von Ni, Qiufen, Guo, Jianxiong, Wu, Weili, Huang, Chuanhe

“… Next, we propose a continuous greedy algorithm using the properties of the relaxed …”
Volltext

Constrained Submodular Maximization: Beyond 1/e von 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] …”
Volltext

Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions von 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. DSFs are an expressive class of submodular …”
Weitere Angaben