Guess free maximization of submodular and linear sums

DOI10.1007/s00453-020-00757-9OpenAlexW3049105815MaRDI QIDQ5925508

Moran Feldman

Publication date: 8 April 2021

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

curvaturesubmodular maximizationcontinuous greedy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

A new greedy strategy for maximizing monotone submodular function under a cardinality constraint ⋮ On maximizing sums of non-monotone submodular and linear functions ⋮ Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions ⋮ Correction to: ``Guess free maximization of submodular and linear sums

Cites Work

• Unnamed Item
• Unnamed Item
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Maximizing Symmetric Submodular Functions
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Online Contention Resolution Schemes
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• A Stochastic Probing Problem with Applications
• Constrained Submodular Maximization via a Nonsymmetric Technique
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
• Submodular Maximization with Cardinality Constraints
• Fast algorithms for maximizing submodular functions
• A Unified Continuous Greedy Algorithm for Submodular Maximization

This page was built for publication: Guess free maximization of submodular and linear sums