Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
From MaRDI portal
Publication:2848923
DOI10.1007/978-3-642-38016-7_15zbMath1394.68447arXiv1109.5931OpenAlexW1544574065MaRDI QIDQ2848923
Ravishankar Krishnaswamy, Anupam Gupta, Kirk R. Pruhs
Publication date: 13 September 2013
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.5931
Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Energy-efficient scheduling and routing via randomized rounding, The efficiency-fairness balance of round robin scheduling, Randomized oblivious integral routing for minimizing power cost, Online covering with \(\ell_q\)-norm objectives and applications to network design, Unnamed Item, Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs, Station assignment with reallocation, Fair Scheduling via Iterative Quasi-Uniform Sampling, Energy efficient scheduling of parallelizable jobs, Scheduling to minimize energy and flow time in broadcast scheduling, Welfare maximization with production costs: a primal dual approach, Hallucination Helps: Energy Efficient Virtual Circuit Routing, Non-Clairvoyant Precedence Constrained Scheduling., Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
