The following pages link to (Q3112637):
Displaying 14 items.
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Time bounded adaptive information coverage in social networks (Q5858179) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
- Stochastic submodular probing with state-dependent costs (Q5918543) (← links)
- Stochastic submodular probing with state-dependent costs (Q5918731) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
- Novel algorithms for maximum DS decomposition (Q5919061) (← links)
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)
- On competitive recommendations (Q5964063) (← links)
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (Q6077937) (← links)
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity (Q6118307) (← links)
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback (Q6161475) (← links)
- Stochastic Probing with Increasing Precision (Q6187078) (← links)
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem (Q6196896) (← links)
