Set function optimization
From MaRDI portal
Publication:2314057
DOI10.1007/s40305-018-0233-3zbMath1438.90002OpenAlexW2903669089MaRDI QIDQ2314057
Zhao Zhang, Weili Wu, Ding-Zhu Du
Publication date: 19 July 2019
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0233-3
Related Items (14)
A short proof for stronger version of DS decomposition in set function optimization ⋮ Generalized self-profit maximization in attribute networks ⋮ A variation of DS decomposition in set function optimization ⋮ Competition-based generalized self-profit maximization in dual-attribute networks ⋮ A constrained two-stage submodular maximization ⋮ Minimum non-submodular cover problem with applications ⋮ Parametric monotone function maximization with matroid constraints ⋮ On strict submodularity of social influence ⋮ Sequence submodular maximization meets streaming ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Optimizing network topology for average controllability ⋮ Nonsubmodular constrained profit maximization from increment perspective ⋮ Generalized self-profit maximization and complementary-profit maximization in attribute networks
Cites Work
- Unnamed Item
- A framework of discrete DC programming by discrete convex analysis
- A faster strongly polynomial time algorithm for submodular function minimization
- Decomposition of submodular functions
- Geometric algorithms and combinatorial optimization
- A note on maximizing a submodular set function subject to a knapsack constraint
- Power consumption in packet radio networks
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- An analysis of the greedy algorithm for the submodular set covering problem
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Submodular functions and optimization.
- Constrained Monotone Function Maximization and the Supermodular Degree
- Welfare maximization and the supermodular degree
- Maximizing Non-monotone Submodular Functions
- Scalably scheduling processes with arbitrary speedup curves
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An analysis of approximations for maximizing submodular set functions—I
- Non-monotone submodular maximization under matroid and knapsack constraints
- A Unified Continuous Greedy Algorithm for Submodular Maximization
This page was built for publication: Set function optimization
