Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley. Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. In Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings. Volume 8096 of Lecture Notes in Computer Science, pages 142-157, Springer, 2013. [doi]

This author has not been identified. Look up 'Kyle Fox' in GoogleThis author has not been identified. Look up 'Sungjin Im' in GoogleThis author has not been identified. Look up 'Janardhan Kulkarni' in GoogleThis author has not been identified. Look up 'Benjamin Moseley' in Google

runs on WebDSL