Pages that link to "Item:Q4575606"
From MaRDI portal
The following pages link to Deterministic Algorithms for Submodular Maximization Problems (Q4575606):
Displaying 18 items.
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Restricted strong convexity implies weak submodularity (Q1990594) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
- Deterministic Algorithms for Submodular Maximization Problems (Q4554360) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- (Q4969210) (← links)
- (Q5075815) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- (Q5111744) (← links)
- Deterministic (½ + <i>ε</i>)-Approximation for Submodular Maximization over a Matroid (Q5236197) (← links)
- Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)