Randomization and approximation techniques in computer science. 2nd international workshop, RANDOM '98. Barcelona, Spain, October 8--10, 1998. Proceedings (Q1270001)

The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{Frieze, Alan M.}, Disjoint paths in expander graphs via random walks: A short survey, 1-14 [Zbl 0927.05046] \textit{Rödl, Vojtěch; Ruciński, Andrzej; Wagner, Michelle}, An algorithmic embedding of graphs via perfect matchings, 25-34 [Zbl 0927.05074] \textit{Lu, Chi-Jen}, Deterministic hypergraph coloring and its applications, 35-46 [Zbl 0927.05032] \textit{Armoni, Roy}, On the derandomization of space-bounded computations, 47-59 [Zbl 0946.68041] \textit{Gärtner, Bernd}, Combinatorial linear programming: Geometry can help, 82-96 [Zbl 0967.90078] \textit{Sharell, Abraham}, A note on bounding the mixing time by linear programming, 97-115 [Zbl 0941.60082] \textit{Raab, Martin; Steger, Angelika}, ``Balls into bins'' -- a simple and tight analysis, 159-170 [Zbl 0928.60001] \textit{Steinhöfel, K.; Albrecht, A.; Wong, C. K.}, On various cooling schedules for simulated annealing applied to the job shop problem, 260-279 [Zbl 0927.90055] \textit{Goldberg, Leslie Ann; Jerrum, Mark}, The ``Burnside process'' converges slowly, 331-345 [Zbl 0945.60003] \textit{Andersson, Gunnar; Engebretsen, Lars}, Sampling methods applied to dense instances of non-Boolean optimization problems, 357-368 [Zbl 0944.90103]