A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions

DOI10.1007/978-3-030-41672-0_10zbMath1440.90094OpenAlexW3007115331MaRDI QIDQ3297828

Qizhi Fang, Suning Gong, Ding-Zhu Du, Qingqin Nong

Publication date: 20 July 2020

Published in: Complexity and Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-41672-0_10

zbMATH Keywords

submodular functiondouble greedy algorithmnon-monotone function

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Maximizing a class of submodular utility functions
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• Submodular functions: from discrete to continuous domains
• Submodular Function Maximization on the Bounded Integer Lattice
• Maximizing Non-monotone Submodular Functions
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
• Deterministic Algorithms for Submodular Maximization Problems
• Unconstrained submodular maximization with constant adaptive complexity
• Submodular Maximization with Cardinality Constraints
• Learning submodular functions
• An efficient algorithm for image segmentation, Markov random fields and related problems
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Online submodular welfare maximization: Greedy is optimal

This page was built for publication: A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions