research
∙
09/21/2023
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs
We consider the precedence-constrained scheduling problem to minimize th...
share
research
∙
11/03/2022
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
We study kill-and-restart and preemptive strategies for the fundamental ...
research
∙
03/24/2022
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs
This paper studies a variant of the minimum-cost flow problem in a graph...
research
∙
11/20/2018
Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
We consider atomic splittable congestion games with affine cost function...
research
∙
05/31/2018
