Titlebook: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques; 4th International Wo Michel Goemans,Klaus Jansen,Lu

assail

Michel Goemans,Klaus Jansen,Luca TrevisanIncludes supplementary material:

收集

Cougar

inflame

CULP

HAIL

Stress, Fatigue and the Working Environment,plete bipartite graph between cities and facilities. We use our algorithm to improve recent results for some variants of the problem, such as the fault tolerant and outlier versions. In addition, we introduce a new variant which can be seen as a special case of the concave cost version of this problem.

引起

Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flowsnetwork, can be solved using combinatorial techniques. Moreover, for parallel disk systems, we develop improved approximation algorithms, trading performance guarantee for running time. If the number of disks is constant, we achieve a 2-approximation.

Transfusion

Online Weighted Flow Time and Deadline Schedulingof the jobs unfinished by some unknown deadline . on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for Deadline Scheduling. We finally give an .(1)-competitive algorithm for Deadline Scheduling.

易改变

Arthr-

Conference proceedings 2001alysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.