Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid
From MaRDI portal
Publication:2670444
DOI10.1016/j.orl.2021.09.006OpenAlexW3204589644MaRDI QIDQ2670444
Daniel Tihanyi, Orcun Karaca, Maryam Kamgarpour
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.01135
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
- The reverse greedy algorithm for the metric k-median problem
- Hereditary systems and greedy-type algorithms.
- A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
- Combinatorial auctions with decreasing marginal utilities
- Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid
- An analysis of approximations for maximizing submodular set functions—I
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Submodularity in Input Node Selection for Networked Linear Systems: Efficient Algorithms for Performance and Controllability
- Actuator Placement Under Structural Controllability Using Forward and Reverse Greedy Algorithms
- Learning with Submodular Functions: A Convex Optimization Perspective
- Matroids and the greedy algorithm
This page was built for publication: Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid
