Journal of Algorithms
, Volume 39
Volume 39, Number 1, April 2001
Shay Halperin
,
Uri Zwick
: Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests. 1-46
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
: Fault-Tolerant Broadcasting in Radio Networks. 47-67
Wei-Chang Yeh
: A Simple Algorithm for the Planar Multiway Cut Problem. 68-77
Josep Díaz
,
Mathew D. Penrose
,
Jordi Petit
,
Maria J. Serna
: Approximating Layout Problems on Random Geometric Graphs. 78-116
Colin Cooper
,
Martin E. Dyer
,
Alan M. Frieze
: On Markov Chains for Randomly H-Coloring a Graph. 117-134
Volume 39, Number 2, May 2001
Reuven Bar-Yehuda
: Using Homogeneous Weights for Approximating the Partial Cover Problem. 137-144
Kazuo Iwama
,
Eiji Miyano
: A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. 145-161
Gunnar Andersson
,
Lars Engebretsen
,
Johan Håstad
: A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. 162-204
J. Ian Munro
,
Venkatesh Raman
,
S. Srinivasa Rao
: Space Efficient Suffix Trees. 205-222
Barun Chandra
,
Magnús M. Halldórsson
: Greedy Local Improvement and Weighted Set Packing Approximation. 223-240
Copyright ©
Fri Dec 4 20:32:29 2009 by
Michael Ley
(
ley@uni-trier.de
)