Pages that link to "Item:Q5419149"
From MaRDI portal
The following pages link to Submodular function maximization via the multilinear relaxation and contention resolution schemes (Q5419149):
Displaying 37 items.
- Matroid and knapsack center problems (Q300451) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- (Q4558139) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- (Q5002731) (← links)
- (Q5005131) (← links)
- (Q5053276) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
