A list of technical reports, each of these reports is available at:
Prof. Dr. Susanne Albers
| |
2004 |
| 0452 |
Exact algorithms for procurement problems under
a total quantity discount structure, 27p, |
| | by D. Goossens, A. Maas,
F. Spieksma, and J. van de Klundert. |
| |
(PDF file available)
|
| 0451 |
Counting aggregate classifiers, 22p, |
| | by J. Adem, W. Gochet, and
F. Spieksma. |
| |
(PDF file available)
|
| 0433 |
Approximation algorithms for rectangle stabbing
and interval stabbing problems, 29p, |
| | by S. Kovaleva and F. Spieksma. |
| |
(PDF file available)
|
| |
2003 |
| 0398 |
Parallel Prefetching and Caching is NP-hard, |
| | by C. Ambühl and B. Weber. |
| |
(PS file available)
|
| 0363 |
An approximation algorithm for a generalized
assignment problem with small resource requirements, 20p, |
| | by J. Aerts, J. Korst, and F. Spieksma. |
| |
(PDF file available)
|
| 0362 |
Modeling and solving the periodic maintenance
problem, 26p, |
| | by A. Grigoriev, J. van
de Klundert, and F. Spieksma. |
| |
(PDF file available)
|
| 0358 |
Partitioning a Permutation Graph: Algorithms and
an Application, 22p, |
| | by L. Moonen and F. Spieksma. |
| |
(PDF file available)
|
| 0330 |
Telecommunication Carrier Selection under Volume
Discounts: a Case Study, 17p, |
| | by J. van de Klundert, J. Kuipers,
F. Spieksma, and M. Winkels. |
| |
(PDF file available)
|
| 0180 |
Cuts and Disjoint Paths in the Valley-Free Path Model, |
| | by T. Erlebach, A. Hall, A. Panconesi, and
D. Vukadinovic. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0177 |
Wavelength Conversion in Shortest-Path All-Optical Networks, |
| | by T. Erlebach and S. Stefanakos. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0173 |
An Algorithmic View on OVSF Code Assignment, |
| | by T. Erlebach, R. Jacob, M. Mihalak,
M. Nunkesser, G. Szabo, and P. Widmayer. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0171 |
Routing and Call Control Algorithms for Ring Networks, |
| | by S. Anand and T. Erlebach. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0155 |
Greedy edge-disjoint paths in complete graphs, |
| | by P. Carmi, T. Erlebach, and
Y. Okamoto. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0024 |
An FPTAS for Quickest Multicommodity
Flows with Inflow-Dependent Transit Times, |
| | by A. Hall, K. Langkau, and M. Skutella. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| |
2002 |
| 0242 |
Local search heuristic for multi-index assignment
problems with decomposable costs, 18p, |
| | by H. Bandelt, A. Maas,
and F. Spieksma. |
| 0153 |
On Shortest-Path All-Optical Networks without Wavelength
Conversion Requirements, |
| | by T. Erlebach and S. Stefanakos. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0152 |
Interval selection: Applications, algorithms, and lower bounds, |
| | by T. Erlebach and F. Spieksma. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0145 |
Classifying Customer-Provider Relationships in the
Internet, |
| | by T. Erlebach, A. Hall, and T. Schank. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0142 |
Call Admission Control for Advance Reservation
Requests with Alternatives, |
| | by T. Erlebach. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0132 |
Wavelength Conversion in Networks of Bounded Treewidth, |
| | by T. Erlebach and S. Stefanakos. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| |
2001 |
| 0149 |
A Branch-and-Price Algorithm for a Hierarchical
Crew Scheduling Problem, 19p, |
| | by D. B.C. Faneyte, F. Spieksma,
and G. J. Woeginger. |
| 0121 |
NP-Hardness of Broadcast Scheduling and Inapproximability of
Single-Source Unsplittable Min-Cost Flow, |
| | by T. Erlebach and A. Hall. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
| 0109 |
Approximation Algorithms and Complexity Results
for Path Problems in Trees of Rings, |
| | by T. Erlebach. |
| |
(PDF file available)
,
(gzipped PS-file available)
|
|