An accelerated continuous greedy algorithm for maximizing strong submodular functions

DOI10.1007/S10878-013-9685-XzbMath1334.90150OpenAlexW2009120665MaRDI QIDQ887854

Zengfu Wang, Xuezhi Wang, Quan Pan, William Moran

Publication date: 3 November 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9685-x

zbMATH Keywords

approximation algorithmmatroidmonotone submodular set functioncontinuous greedy algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
• Inapproximability results for combinatorial auctions with submodular utility functions
• A note on maximizing a submodular set function subject to a knapsack constraint
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Combinatorial auctions with decreasing marginal utilities
• A threshold of ln n for approximating set cover
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Comments on bases in dependence structures
• Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions

This page was built for publication: An accelerated continuous greedy algorithm for maximizing strong submodular functions