Scholars@Duke publication: Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints.

construction release_alert

Scholars@Duke will be down for maintenance for approximately one hour starting Tuesday, 11/11 @1pm ET

cancel

Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints.

Publication , Conference

Im, S; Kulkarni, J; Munagala, K

Published in: STOC

2014

Duke Scholars

Author Kamesh Munagala Computer Science

Published In

STOC

ISBN

978-1-4503-2710-7

Publication Date

2014

Start / End Page

313 / 322

Publisher

ACM

Citation

APA

Chicago

ICMJE

MLA

NLM

Im, S., Kulkarni, J., & Munagala, K. (2014). Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. In D. B. Shmoys (Ed.), STOC (pp. 313–322). ACM.

Im, Sungjin, Janardhan Kulkarni, and Kamesh Munagala. “Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints.” In STOC, edited by David B. Shmoys, 313–22. ACM, 2014.

Im S, Kulkarni J, Munagala K. Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. In: Shmoys DB, editor. STOC. ACM; 2014. p. 313–22.

Im, Sungjin, et al. “Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints.” STOC, edited by David B. Shmoys, ACM, 2014, pp. 313–22.

Im S, Kulkarni J, Munagala K. Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. In: Shmoys DB, editor. STOC. ACM; 2014. p. 313–322.

Published In

STOC

ISBN

978-1-4503-2710-7

Publication Date

2014

Start / End Page

313 / 322

Publisher

ACM