Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Spieksma, Frits"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Balancing profits and costs on trees
Sofie Coene
,
Carlo Filippi
,
Frits C.R. Spieksma
,
Elisa Stevanato
Networks
61
(3), 2013, pp. 200-211
Approximation algorithms for rectangle stabbing and interval stabbing problems
Sofia Kovaleva
,
Frits C.R. Spieksma
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 748-768
Approximation of rectangle stabbing and interval stabbing problems
Sofia Kovaleva
,
Frits C.R. Spieksma
Lecture Notes in Computer Science
3221
, 2004, pp. 426-435
Approximation of a retrieval problem for parallel disks
Joep Aerts
,
Jan Korst
,
Frits Spieksma
Lecture Notes in Computer Science
2653
, 2003, pp. 178-188
Interval selection: Applications, algorithms, and lower bounds
Thomas Erlebach
,
Frits C.R. Spieksma
Journal of Algorithms
46
(1), 2003, pp. 27-53
Approximation of a geometric set covering problem
Sofia Kovaleva
,
Frits C.R. Spieksma
Lecture Notes in Computer Science
2223
, 2001, pp. 493-501
The clique partitioning problem: facets and tatching facets
Maarten Oosten
,
Jeroen H.G.C. Rutten
,
Frits C.R. Spieksma
Networks
38
(4), 2001, pp. 209-226
Simple algorithms for a weighted interval selection problem
Thomas Erlebach
,
Frits C.R. Spieksma
Lecture Notes in Computer Science
1969
, 2000, pp. 228-240
Approximating an interval scheduling problem
Frits C.R. Spieksma
Lecture Notes in Computer Science
1444
, 1998, pp. 169-180
Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
S. Thomas McCormick
,
Scott R. Smallwood
,
Frits C.R. Spieksma
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 509-517
Scheduling jobs of equal length: Complexity, facets and computational results
Yves Crama
,
Frits C.R. Spieksma
Lecture Notes in Computer Science
920
, 1995, pp. 277-291
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Hans-Jürgen Bandelt
,
Yves Crama
,
Frits C.R. Spieksma
Discrete Applied Mathematics
49
, 1994, pp. 25-50
A general class of greedily solvable linear programs
Maurice Queyranne
,
Frits Spieksma
,
Fabio Tardella
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 385-399