7 citations · 11 across the 6 of their papers we have counts for
7 papers · 1 filter
Covering a tree with rooted subtrees
Lin Chen, Daniel Marx
We consider the multiple traveling salesman problem on a weighted tree. In this problem there are salesmen located at the root initially. Each of them will visit a subset of ve…
Optimal Algorithms for Scheduling under Time-of-Use Tariffs
Lin Chen, Nicole Megow, Roman Rischke +2
We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition…
A general framework for handling commitment in online throughput maximization
Lin Chen, Franziska Eberle, Nicole Megow +2
We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-serve…
On the NP-hardness of scheduling with time restrictions
An Zhang, Yong Chen, Lin Chen +1
In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer , there is a set of jobs…
Scheduling Maintenance Jobs in Networks
Fidaa Abed, Lin Chen, Yann Disser +5
We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focu…
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization
Lin Chen, Nicole Megow, Kevin Schewior
We consider the online machine minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule o…