On maximizing sums of non-monotone submodular and linear functions

DOI10.1007/s00453-023-01183-3arXiv2205.15874OpenAlexW4388634979MaRDI QIDQ6130322

Benjamin Qi

Publication date: 2 April 2024

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.15874

zbMATH Keywords

regularizationinapproximabilitysubmodular maximizationcontinuous greedydouble greedy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Online maximum directed cut
• Parallel approximation algorithms by positive linear programming
• Oblivious algorithms for the maximum directed cut problem
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Symmetry and Approximability of Submodular Maximization Problems
• Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
• Maximizing Non-monotone Submodular Functions
• 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
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Constrained Submodular Maximization via a Nonsymmetric Technique
• Online Submodular Maximization with Preemption
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Guess free maximization of submodular and linear sums

This page was built for publication: On maximizing sums of non-monotone submodular and linear functions