The following pages link to (Q4558139):
Displayed 13 items.
- Sparse approximate solutions to max-plus equations (Q2061850) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- A discussion on practical considerations with sparse regression methodologies (Q2225315) (← links)
- Toward a sparsity theory on weighted lattices (Q2678919) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
- Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)
- Weakly Submodular Function Maximization Using Local Submodularity Ratio. (Q6065474) (← links)
- Maximization of nonsubmodular functions under multiple constraints with applications (Q6110009) (← links)
- Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
- Forward-selected panel data approach for program evaluation (Q6163247) (← links)
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)
- Unified greedy approximability beyond submodular maximization (Q6166910) (← links)