The Geometry of Scheduling
From MaRDI portal
Publication:5173251
DOI10.1137/130911317zbMath1335.90031arXiv1008.4889OpenAlexW2570727021MaRDI QIDQ5173251
Publication date: 9 February 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.4889
Related Items (23)
A PTAS for the Weighted Unit Disk Cover Problem ⋮ Dual Techniques for Scheduling on a Machine with Varying Speed ⋮ An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems ⋮ Variants of Multi-resource Scheduling Problems with Equal Processing Times ⋮ An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem ⋮ Geometric dominating-set and set-cover via local-search ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Demand Hitting and Covering of Intervals ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time ⋮ The TV advertisements scheduling problem ⋮ Covering segments with unit squares ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Optimal algorithms for scheduling under time-of-use tariffs ⋮ How unsplittable-flow-covering helps scheduling with job-dependent cost functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From Preemptive to Non-preemptive Scheduling Using Rejections ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Unnamed Item ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ Approximation algorithms for the geometric firefighter and budget fence problems ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
This page was built for publication: The Geometry of Scheduling
