ESA
2008
Springer
13 years 11 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
ESA
2008
Springer
13 years 11 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...