Login / Signup

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.

Kyle FoxSungjin ImJanardhan KulkarniBenjamin Moseley
Published in: APPROX-RANDOM (2013)
Keyphrases
  • convex functions
  • convex programs
  • objective function
  • scheduling problem
  • convex programming
  • convex sets
  • quasiconvex
  • bayesian networks
  • linear program
  • single machine
  • dc programming