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: Journal=J. Algorithms AND Volume=59
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximations for minimum and min-max vehicle routing problems
Esther M. Arkin
,
Refael Hassin
,
Asaf Levin
Journal of Algorithms
59
(1), 2006, pp. 1-18
Maintaining time-decaying stream aggregates
Edith Cohen
,
Martin J. Strauss
Journal of Algorithms
59
(1), 2006, pp. 19-36
A linear time approximation scheme for the single machine scheduling problem with controllable processing times
Monaldo Mastrolilli
Journal of Algorithms
59
(1), 2006, pp. 37-52
Semi-matchings for bipartite graphs and load balancing
Nicholas J.A. Harvey
,
Richard E. Ladner
,
László Lovász
,
Tami Tamir
Journal of Algorithms
59
(1), 2006, pp. 53-78
On generalized gossiping and broadcasting
Samir Khuller
,
Yoo-Ah Kim
,
Yung-Chun (Justin) Wan
Journal of Algorithms
59
(2), 2006, pp. 81-106
Efficient algorithms for a constrained
k
-tree core problem in a tree network
Biing-Feng Wang
,
Shietung Peng
,
Hong-Yi Yu
,
Shan-Chyun Ku
Journal of Algorithms
59
(2), 2006, pp. 107-124
Computing bounded-degree phylogenetic roots of disconnected graphs
Zhi-Zhong Chen
,
Tatsuie Tsukiji
Journal of Algorithms
59
(2), 2006, pp. 125-148
An algorithmic sign-reversing involution for special rim-hook tableaux
Bruce E. Sagan
,
Jaejin Lee
Journal of Algorithms
59
(2), 2006, pp. 149-161