A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

preview_player
Показать описание
Alina Ene, Boston University
Discrete Optimization via Continuous Relaxation
Рекомендации по теме
welcome to shbcf.ru