A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions
From MaRDI portal
Publication:3297828
DOI10.1007/978-3-030-41672-0_10zbMATH Open1440.90094OpenAlexW3007115331MaRDI QIDQ3297828FDOQ3297828
Qizhi Fang, Qingqin Nong, Suning Gong, Du Ding-Zhu
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
Cites Work
- Title not available (Why is that?)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Maximizing Non-monotone Submodular Functions
- Learning submodular functions
- Maximizing a class of submodular utility functions
- Deterministic Algorithms for Submodular Maximization Problems
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Submodular functions: from discrete to continuous domains
- Online submodular welfare maximization: Greedy is optimal
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Submodular Maximization with Cardinality Constraints
- Submodular Function Maximization on the Bounded Integer Lattice
- Unconstrained submodular maximization with constant adaptive complexity
This page was built for publication: A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297828)
