Online Algorithms for Covering and Packing Problems with Convex Objectives - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang 0002, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi. Online Algorithms for Covering and Packing Problems with Convex Objectives. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. pages 148-157, IEEE, 2016. [doi]

This author has not been identified. Look up 'Yossi Azar' in GoogleThis author has not been identified. Look up 'Niv Buchbinder' in GoogleThis author has not been identified. Look up 'T.-H. Hubert Chan' in GoogleThis author has not been identified. Look up 'Shahar Chen' in GoogleThis author has not been identified. Look up 'Ilan Reuven Cohen' in GoogleThis author has not been identified. Look up 'Anupam Gupta' in GoogleThis author has not been identified. Look up 'Zhiyi Huang 0002' in GoogleThis author has not been identified. Look up 'Ning Kang' in GoogleThis author has not been identified. Look up 'Viswanath Nagarajan' in GoogleThis author has not been identified. Look up 'Joseph Naor' in GoogleThis author has not been identified. Look up 'Debmalya Panigrahi' in Google

runs on WebDSL