Výsledky vyhledávání - "Submodular functions"

Maximizing monotone submodular functions over the integer lattice Autor Soma, Tasuku, Yoshida, Yuichi

“…The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade…”
Získat plný text

String Submodular Functions With Curvature Constraints Autor Zhenliang Zhang, Chong, Edwin K. P., Pezeshki, Ali, Moran, William

“…Consider the problem of choosing a string of actions to optimize an objective function that is string submodular. It was shown in previous papers that the…”
Získat plný text

Efficient deterministic algorithms for maximizing symmetric submodular functions Autor Wan, Zongqi, Zhang, Jialin, Sun, Xiaoming, Zhang, Zhijie

“… It, therefore, suffers from high query complexity and is inherently randomized. In this paper, we present several efficient deterministic algorithms for maximizing a symmetric submodular function under various constraints…”
Získat plný text

Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint Autor Shi, Yishuo, Lai, Xiaoyan

“…The maximization of non-negative monotone submodular functions under a certain constraint is intensively studied…”
Získat plný text

Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint Autor Huang, Chien-Chung, Kakimura, Naonori

“…In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in a streaming setting…”
Získat plný text

Maximizing k-submodular functions under budget constraint: applications and streaming algorithms Autor Pham, Canh V., Vu, Quang C., Ha, Dung K. T., Nguyen, Tai T., Le, Nguyen D.

“…: Given a finite set V , a budget B and a k -submodular function f : ( k + 1 ) V ↦ R + , the problem asks to find a solution s = ( S 1 , S 2 , … , S k ) ∈ ( k + 1…”
Získat plný text

Approximation algorithm of maximizing non-submodular functions under non-submodular constraint Autor Lai, Xiaoyan, Shi, Yishuo

“…Nowadays, maximizing the non-negative and non-submodular objective functions under Knapsack constraint or Cardinality constraint is deeply researched…”
Získat plný text

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint Autor Huang, Chien-Chung, Kakimura, Naonori, Yoshida, Yuichi

“…In this paper, we consider the problem of maximizing a monotone submodular function subject to a knapsack constraint in the streaming setting…”
Získat plný text

On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints Autor Yu, Kemin, Li, Min, Zhou, Yang, Liu, Qian

“…A k -submodular function is a generalization of a submodular function. The definition domain of a k -submodular function is a collection of k -disjoint subsets instead of simple subsets of ground set…”
Získat plný text

Maximizing h-hop Independently Submodular Functions Under Connectivity Constraint Autor Xu, Wenzheng, Peng, Dezhong, Liang, Weifa, Jia, Xiaohua, Xu, Zichuan, Zhou, Pan, Wu, Weigang, Chen, Xiang

“…This study is motivated by the maximum connected coverage problem (MCCP), which is to deploy a connected UAV network with given K UAVs in the top of a disaster…”
Získat plný text

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints Autor Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath, Sviridenko, Maxim

“… Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the first constant-factor approximation algorithm for maximizing any nonnegative submodular function subject to multiple matroid or knapsack constraints…”
Získat plný text

Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint Autor Gong, Shu-Fang, Liu, Bin, Fang, Qi-Zhi

Získat plný text

A primal-dual algorithm for monotone submodular maximization Autor Chakrabarty, Deeparnab, Coté, Luc

“…In this paper we design and analyze a new approximation algorithm for the classic discrete optimization problem of maximizing a monotone submodular function subject to a cardinality constraint…”
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 simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint Autor Amanatidis, Georgios, Birmpas, Georgios, Markakis, Evangelos

“… •We study symmetric submodular maximization subject to a knapsack constraint.•Submodular functions become monotone when restricted to their local maxima.•They are “almost…”
Získat plný text

Constrained submodular maximization via greedy local search Autor Sarpatwar, Kanthi K., Schieber, Baruch, Shachnai, Hadas

“…We present a simple combinatorial 1−e−22-approximation algorithm for maximizing a monotone submodular function subject to a knapsack and a matroid constraint…”
Získat plný text

Symmetry and Approximability of Submodular Maximization Problems Autor Vondrak, Jan

“…A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem…”
Získat plný text

A refined analysis of submodular Greedy Autor Kulik, Ariel, Schwartz, Roy, Shachnai, Hadas

“…Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic…”
Získat plný text

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

“…], the potential function gives more weight to elements covered multiple times. We generalize this approach from coverage functions to arbitrary monotone submodular functions…”
Získat plný text

An almost optimal approximation algorithm for monotone submodular multiple knapsack Autor Fairstein, Yaron, Kulik, Ariel, Naor, Joseph (Seffi), Raz, Danny, Shachnai, Hadas

“…We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint…”
Získat plný text