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
[2]
Hilfe
Suche: Author="Kellerer, Hans"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
Hans Kellerer
,
Vitaly A. Strusevich
Algorithmica
57
(4), 2010, pp. 769-795
Minimizing total weighted earliness-tardiness on a single machine around a small common due date: An FPTAS using quadratic knapsack
Hans Kellerer
,
Vitaly A. Strusevich
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 357-383
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Hans Kellerer
,
Vitaly A. Strusevich
Theoretical Computer Science
369
(1-3), 2006, pp. 230-238
Semi-on-line multiprocessor scheduling with given total processing time
T.C. Edwin Cheng
,
Hans Kellerer
,
Vladimir Kotov
Theoretical Computer Science
337
(1-3), 2005, pp. 134-146
Minimizing the maximum lateness
Hans Kellerer
Computer and Information Science Series
, 2004, pp. 10-10
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
Hans Kellerer
,
Renata Mansini
,
Ulrich Pferschy
,
Maria Grazia Speranza
Journal of Computer and System Sciences
66
(2), 2003, pp. 349-370
On-line algorithms for cardinality constrained bin packing problems
Luitpold Babel
,
Bo Chen
,
Hans Kellerer
,
Vladimir Kotov
Lecture Notes in Computer Science
2223
, 2001, pp. 695-706
Approximating multi-objective knapsack problems
Thomas Erlebach
,
Hans Kellerer
,
Ulrich Pferschy
Lecture Notes in Computer Science
2125
, 2001, pp. 210-221
A 5/4 linear time bin packing algorithm
József Békési
,
Gábor Galambos
,
Hans Kellerer
Journal of Computer and System Sciences
60
(1), 2000, pp. 145-160
A PTAS for the multiple subset sum problem with different knapsack capacities
Alberto Caprara
,
Hans Kellerer
,
Ulrich Pferschy
Information Processing Letters
73
(3-4), 2000, pp. 111-118
Approximability and nonapproximability results for minimizing total flow time on a single machine
Hans Kellerer
,
T. Tautenhahn
,
G. Woeginger
SIAM Journal on Computing
28
(4), 1999, pp. 1155-1166
A polynomial time approximation scheme for the multiple knapsack problem
Hans Kellerer
Lecture Notes in Computer Science
1671
, 1999, pp. 51-62
A 13/12 approximation algorithm for bin packing with extendable bins
Paolo Dell'Olmo
,
Hans Kellerer
,
Maria Grazia Speranza
,
Zsolt Tuza
Information Processing Letters
65
(5), 1998, pp. 229-233
A new fully polynomial approximation scheme for the knapsack problem
Hans Kellerer
,
Ulrich Pferschy
Lecture Notes in Computer Science
1444
, 1998, pp. 123-134
An efficient approximation scheme for the subset-sum problem
Hans Kellerer
,
Ulrich Pferschy
,
Maria Grazia Speranza
Lecture Notes in Computer Science
1350
, 1997, pp. 394-403
Approximability and nonapproximability results for minimizing total flow time on a single machine
Hans Kellerer
,
Thomas Tautenhahn
,
Gerhard J. Woeginger
Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 418-426
Approximability and nonapproximability results for minimizing total flow time on a single machine
Hans Kellerer
,
Thomas Tautenhahn
,
Gerhard J. Woeginger
Technical Report (42), 1995, August
Computing the optimum stock size
Hans Kellerer
,
Franz Rendl
,
Gerhard J. Woeginger
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 147-159
On the Euclidean two paths problem
Hans Kellerer
,
Gerhard Woeginger
Discrete Applied Mathematics
47
, 1993, pp. 165-173
A tight bound for 3-partitioning
Hans Kellerer
,
Gerhard Woeginger
Discrete Applied Mathematics
45
(3), 1993, pp. 249-259