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]
@inproceedings{KaleLP16,
title = {Hardness of Online Sleeping Combinatorial Optimization Problems},
author = {Satyen Kale and Chansoo Lee and Dávid Pál},
year = {2016},
url = {http://papers.nips.cc/paper/6450-hardness-of-online-sleeping-combinatorial-optimization-problems},
researchr = {https://researchr.org/publication/KaleLP16},
cites = {0},
citedby = {0},
pages = {2181-2189},
booktitle = {Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain},
editor = {Daniel D. Lee and Masashi Sugiyama and Ulrike V. Luxburg and Isabelle Guyon and Roman Garnett},
}