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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Worst case bounds for shortest path interval routing
Cyril Gavoille
,
Eric Guévremont
Journal of Algorithms
27
(1), 1998, pp. 1-25
Even directed cycles in
H
-free digraphs
Anna Galluccio
,
Martin Loebl
Journal of Algorithms
27
(1), 1998, pp. 26-41
The greedy search algorithm on binary vectors
Avner Dor
Journal of Algorithms
27
(1), 1998, pp. 42-60
Realization of matrices and directed graphs
Rajeev Motwani
Journal of Algorithms
27
(1), 1998, pp. 61-74
New on-line algorithms for the page replication problem
Susanne Albers
,
Hisashi Koga
Journal of Algorithms
27
(1), 1998, pp. 75-96
Cyclic interlaced quadtree algorithms for Quincunx multiresolution
D.J. Hebert
Journal of Algorithms
27
(1), 1998, pp. 97-128
A survey of fast exponentiation methods
Daniel M. Gordon
Journal of Algorithms
27
(1), 1998, pp. 129-146
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
Timothy M. Chan
Journal of Algorithms
27
(1), 1998, pp. 147-166
How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph
James Gary Propp
,
David Bruce Wilson
Journal of Algorithms
27
(2), 1998, pp. 170-217
Biased random walks, Lyapunov functions, and stochastic analysis of Best Fit bin packing
Claire Kenyon
,
Yuval Rabani
,
Alistair Sinclair
Journal of Algorithms
27
(2), 1998, pp. 218-235
Routing and admission control in general topology networks with poisson arrivals
Anil Kamath
,
Omri Palmon
,
Serge Plotkin
Journal of Algorithms
27
(2), 1998, pp. 236-258
An
O(\log^* n)
approximation algorithm for the asymmetric
p
-center problem
Rina Panigrahy
,
Sundar Vishwanathan
Journal of Algorithms
27
(2), 1998, pp. 259-268
A better approximation algorithm for finding planar subgraphs
Gruia Gălinescu
,
Cristina G. Fernandes
,
Ulrich Finkler
,
Howard Karloff
Journal of Algorithms
27
(2), 1998, pp. 269-302
Quasi-greedy triangulations approximating the minimum weight triangulation
Christos Levcopoulos
,
Drago Krznaric
Journal of Algorithms
27
(2), 1998, pp. 303-338
Data collection for the Sloan Digital Sky Survey - A network-flow heuristic
Robert Lupton
,
F. Miller Maley
,
Neal Young
Journal of Algorithms
27
(2), 1998, pp. 339-356