Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
type: Item
instance of: scholarly article
title: Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
author: Min Cui
author: Ruiqi Yang
author: Donglei Du
author: Dachuan Xu
published in: Journal of Combinatorial Optimization
publication date: 2023-01-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7642713
zbMATH Keywords: unconstrained
zbMATH Keywords: non-submodular
zbMATH Keywords: weakly-monotone
zbMATH Keywords: greedy
MaRDI profile type: Publication
full work available at URL: s10878-022-00978-4
OpenAlex ID: W4315641735
cites work: Maximizing a class of submodular utility functions
cites work: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
cites work: Online Submodular Maximization with Preemption
cites work: Deterministic Algorithms for Submodular Maximization Problems
cites work: Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
cites work: From query complexity to computational complexity
cites work: Maximizing Non-monotone Submodular Functions
cites work: Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
cites work: Approximation algorithms for maximum cut with limited unbalance
cites work: Q5365102
cites work: Q3112637
cites work: Parametric monotone function maximization with matroid constraints
cites work: Combinatorial approximation algorithms for the maximum directed cut problem
cites work: Q5405212
cites work: Q2941641
cites work: Facility location and supply chain management. A review
cites work: Simplified mechanisms with an application to sponsored-search auctions
cites work: Q3549607
DOI: 10.1007/S10878-022-00978-4
Recommended article: Approximation for maximizing monotone non-decreasing set functions with a greedy method
Recommended article: Q3640132
Recommended article: Maximizing approximately non-\(k\)-submodular monotone set function with matroid constraint
Recommended article: A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
Recommended article: Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
Recommended article: Approximate solutions in set-valued optimization problems with applications to maximal monotone operators
Recommended article: Fast algorithms for maximizing monotone nonsubmodular functions
Recommended article: Monotone approximations of minimum and maximum functions and multi-objective problems
Recommended article: An approximation algorithm and its performance guarantee for minimizing non-decreasing supermodular set function
description: scientific article; zbMATH DE number 7642713