517 search results - page 70 / 104 » Approximation Algorithms for Scheduling with Reservations |
ISAAC
2001
Springer
15 years 2 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
APNOMS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we realize a DiffServ-based Multicast Router (DSMRouter) to provide the QoS adjustment for multicasting video transmission in the DiffServ network. To reach the QoS ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...