Erlebach Thomas

Thomas Erlebach

Information about the author Thomas Erlebach will soon be added to the site.
Found 4 papers in total
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
2004
We consider the version of broadcast scheduling where a server can transmit W messages...
An improved randomized on-line algorithm for a weighted interval selection problem
An improved randomized on-line algorithm for a weighted interval selection problem
2004
Given a set of weighted intervals, the objective of the weighted interval selection...
Routing flow through a strongly connected graph
Routing flow through a strongly connected graph
2002
It is shown that, for every strongly connected network in which every edge has...
Approximating multiobjective knapsack problems
Approximating multiobjective knapsack problems
2002
For multiobjective optimization problems, it is meaningful to compute a set of...
Papers per page: