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=50
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for optimal multi-resolution quantization
Sorina Dumitrescu
,
Xiaolin Wu
Journal of Algorithms
50
(1), 2004, pp. 1-22
An
\frac {8}{13}
-approximation algorithm for the asymmetric maximum TSP
Markus Bläser
Journal of Algorithms
50
(1), 2004, pp. 23-48
Multiway cuts in node weighted graphs
Naveen Garg
,
Vijay V. Vazirani
,
Mihalis Yannakakis
Journal of Algorithms
50
(1), 2004, pp. 49-61
Rectangular drawings of planar graphs
Md. Saidur Rahman
,
Takao Nishizeki
,
Shubhashis Ghosh
Journal of Algorithms
50
(1), 2004, pp. 62-78
Compact roundtrip routing in directed networks
Lenore J. Cowen
,
Christopher G. Wagner
Journal of Algorithms
50
(1), 2004, pp. 79-95
Deterministic sorting in
O(n log\log n)
time and linear space
Yijie Han
Journal of Algorithms
50
(1), 2004, pp. 96-105
An efficient parameterized algorithm for
m
-set packing
Weijia Jia
,
Chuanlin Zhang
,
Jianer Chen
Journal of Algorithms
50
(1), 2004, pp. 106-117
Algorithms with large domination ratio
Noga Alon
,
Gregory Gutin
,
Michael Krivelevich
Journal of Algorithms
50
(1), 2004, pp. 118-131
The complexity of finding small triangulations of convex 3-polytopes
Alexander Below
,
Jesús A. De Loera
,
Jürgen Richter-Gebert
Journal of Algorithms
50
(2), 2004, pp. 134-167
Restructuring ordered binary trees
William Evans
,
David Kirkpatrick
Journal of Algorithms
50
(2), 2004, pp. 168-193
Cooperative facility location games
Michel X. Goemans
,
Martin Skutella
Journal of Algorithms
50
(2), 2004, pp. 194-214
Strong bias of group generators: An obstacle to the ''product replacement algorithm''
László Babai
,
Igor Pak
Journal of Algorithms
50
(2), 2004, pp. 215-231
Instability of FIFO in session-oriented networks
Matthew Andrews
Journal of Algorithms
50
(2), 2004, pp. 232-245
An approximation algorithm for finding long paths in Hamiltonian graphs
Sundar Vishwanathan
Journal of Algorithms
50
(2), 2004, pp. 246-256
Faster algorithms for string matching with
k
mismatches
Amihood Amir
,
Moshe Lewenstein
,
Ely Porat
Journal of Algorithms
50
(2), 2004, pp. 257-275