Hardness of Online Sleeping Combinatorial Optimization Problems

Satyen Kale, Chansoo Lee, Dávid Pál. Hardness of Online Sleeping Combinatorial Optimization Problems. In Daniel D. Lee, Masashi Sugiyama, Ulrike V. Luxburg, Isabelle Guyon, Roman Garnett, editors, Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain. pages 2181-2189, 2016. [doi]

Abstract

Abstract is missing.