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=Algorithmica AND Volume=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Primal-dual approximation algorithms for integral flow and multicut in trees
N. Garg
,
V.V. Vazirani
,
M. Yannakakis
Algorithmica
18
(1), 1997, pp. 3-20
An approximation algorithm for minimum-cost vertex-connectivity problems
R. Ravi
,
D.P. Williamson
Algorithmica
18
(1), 1997, pp. 21-43
Randomized approximation of bounded multicovering problems
D. Peleg
,
G. Schechtman
,
A. Wool
Algorithmica
18
(1), 1997, pp. 44-66
Improved approximation algorithms for MAX
k
-Cut and MAX BISECTION
A. Frieze
,
M. Jerrum
Algorithmica
18
(1), 1997, pp. 67-81
On approximating the longest path in a graph
D. Karger
,
R. Motwani
,
G.D.S. Ramkumar
Algorithmica
18
(1), 1997, pp. 82-98
A series of approximation algorithms for the acyclic directed Steiner tree problem
A. Zelikovsky
Algorithmica
18
(1), 1997, pp. 99-110
An
O(\log k)
-approximation algorithm for the
k
minimum spanning tree problem in the plane
N. Garg
,
D.S. Hochbaum
Algorithmica
18
(1), 1997, pp. 111-121
An algorithm for the three-dimensional packing problem with asymptotic performance analysis
F.K. Miyazawa
,
Y. Wakabayashi
Algorithmica
18
(1), 1997, pp. 122-144
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
M.M. Halldórsson
,
J. Radhakrishnan
Algorithmica
18
(1), 1997, pp. 145-163
Time-optimal trajectories of a rod in the plane subject to velocity constraints
Yui-Bin Chen
,
D. Ierardi
Algorithmica
18
(2), 1997, pp. 165-197
k
best cuts for circular-arc graphs
K.H. Tsai
,
D.T. Lee
Algorithmica
18
(2), 1997, pp. 198-216
Sorting helps for Voronoi diagrams
L.P. Chew
,
S. Fortune
Algorithmica
18
(2), 1997, pp. 217-228
Orthogonal queries in segments
Takeshi Tokuyama
Algorithmica
18
(2), 1997, pp. 229-245
Improved bounds for electing a leader in a synchronous ring
M. Overmars
,
N. Santoro
Algorithmica
18
(2), 1997, pp. 246-262
A simpler minimum spanning tree verification algorithm
V. King
Algorithmica
18
(2), 1997, pp. 263-270
Classes of cost functions for string edit distance
S.V. Rice
,
H. Bunke
,
T.A. Nartker
Algorithmica
18
(2), 1997, pp. 271-280
On the influence of lookahead in competitive paging algorithms
S. Albers
Algorithmica
18
(3), 1997, pp. 283-305
Trekking in the Alps without freezing or getting tired
M. de Berg
,
M. van Kreveld
Algorithmica
18
(3), 1997, pp. 306-323
Combine and conquer
R.F. Cohen
,
R. Tamassia
Algorithmica
18
(3), 1997, pp. 324-362
Multicommodity flows in even, planar networks
K. Weihe
Algorithmica
18
(3), 1997, pp. 363-383
An efficient parallel algorithm for the layered planar monotone circuit value problem
Vijaya Ramachandran
,
Honghua Yang
Algorithmica
18
(3), 1997, pp. 384-404
The bit complexity of distributed sorting
O. Gerstel
,
S. Zaks
Algorithmica
18
(3), 1997, pp. 405-416
Routing on meshes with buses
M. Kaufmann
,
R. Raman
,
J.F. Sibeyn
Algorithmica
18
(3), 1997, pp. 417-444
Optimal tree contraction and term matching on the hypercube and related networks
E.W. Mayr
,
R. Werchner
Algorithmica
18
(3), 1997, pp. 445-460
On algorithm design for metrical task systems
W.R. Burley
,
S. Irani
Algorithmica
18
(4), 1997, pp. 461-485
Seiten 1
2
>