External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Satyen Kale

This author has not been identified. Look up 'Satyen Kale' in Google

Chansoo Lee

This author has not been identified. Look up 'Chansoo Lee' in Google

Dávid Pál

This author has not been identified. Look up 'Dávid Pál' in Google
runs on