The following pages link to (Q4633865):
Displaying 31 items.
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Algorithms for influence maximization in socio-physical networks (Q2095554) (← links)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
- Strategyproof mechanisms for competitive influence in networks (Q2362354) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Submodularity and Randomized rounding techniques for Optimal Experimental Design (Q2883636) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint (Q5232162) (← links)
- (Q5875486) (← links)
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
- Maximization of nonsubmodular functions under multiple constraints with applications (Q6110009) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6168972) (← links)