Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 4th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2001 and 5th international workshop on randomization and approximation techniques in computer science, RANDOM 2001, Berkeley, CA, USA, August 18--20, 2001. Proceedings (Q5943785)

The articles of mathematical interest will be reviewed individually. The preceding workshop (3rd, 2000) has been reviewed (see Zbl 0947.00047). Indexed articles: \textit{Goemans, Michel X.}, Using complex semidefinite programming for approximating MAX E2-LIN3, 1 [Zbl 0998.68618] \textit{Impagliazzo, Russell}, Hill-climbing vs. simulated annealing for planted bisection problems, 2-5 [Zbl 0998.68586] \textit{Trevisan, Luca}, Error-correcting codes and pseudorandom projections, 7-9 [Zbl 0998.68580] \textit{Vadhan, Salil P.}, Order in pseudorandomness, 10-11 [Zbl 0998.68601] \textit{Albers, Susanne; Witt, Carsten}, Minimizing stall time in single and parallel disk systems using multicommodity network flows, 12-23 [Zbl 1005.68504] \textit{Bar-Yehuda, Reuven; Rawitz, Dror}, On the equivalence between the primal-dual schema and the local-ratio technique, 24-35 [Zbl 1010.90064] \textit{Becchetti, Luca; Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Pruhs, Kirk R.}, Online weighted flow time and deadline scheduling, 36-47 [Zbl 0998.68509] \textit{Berman, Piotr; Fukuyama, Junichiro}, An online algorithm for the postman problem with a small penalty, 48-54 [Zbl 1010.90087] \textit{Bumb, Adriana; Kern, Walter}, A simple dual ascent algorithm for the multilevel facility location problem, 55-62 [Zbl 0998.68702] \textit{Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich}, Approximation schemes for ordered vector packing problems, 63-74 [Zbl 1010.90063] \textit{Dodis, Yevgeniy; Halevi, Shai}, Incremental codes, 75-89 [Zbl 1005.68520] \textit{Even, Guy; Feldman, Jon; Kortsarz, Guy; Nutov, Zeev}, A 3/2-approximation algorithm for augmenting the edge-connectivity of a graph from 1 to 2 using a subset of a given edge set (extended abstract), 90-101 [Zbl 1001.05113] \textit{Garg, Rahul; Kumar, Vijay; Pandit, Vinayaka}, Approximation algorithms for budget-constrained auctions, 102-113 [Zbl 1010.90099] \textit{Halldórsson, Magnús M.; Kortsarz, Guy; Shachnai, Hadas}, Minimizing average completion of dedicated tasks and interval graphs, 114-126 [Zbl 0998.68508] \textit{Mahdian, Mohammad; Markakis, Evangelos; Saberi, Amin; Vazirani, Vijay}, A greedy facility location algorithm analyzed using dual fitting, 127-137 [Zbl 0998.68701] \textit{Matuura, Shiro; Matsui, Tomomi}, 0. 863-approximation algorithm for MAX DICUT, 138-146 [Zbl 1010.90065] \textit{Newman, Alantha}, The maximum acyclic subgraph problem and degree-3 graphs, 147-158 [Zbl 1001.05112] \textit{Rodrigues, Estela Maris; Sagot, Marie-France; Wakabayashi, Yoshiko}, Some approximation results for the maximum agreement forest problem, 159-169 [Zbl 1001.92038] \textit{Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu; Rödl, Vojtech; Rucinski, Andrzej; Szemerédi, Endre}, Near-optimum universal graphs for graphs with bounded degrees (extended abstract), 170-180 [Zbl 1001.05086] \textit{Amano, Kazuyuki; Tromp, John; Vitányi, Paul M. B.; Watanabe, Osamu}, On a generalized ruin problem, 181-191 [Zbl 1018.91013] \textit{Baltz, Andreas; Schoen, Tomasz; Srivastav, Anand}, On the \(b\)-partite random asymmetric traveling salesman problem and its assignment relaxation, 192-201 [Zbl 1010.90089] \textit{Cho, Sung-woo; Goel, Ashish}, Exact sampling in machine scheduling problems, 202-210 [Zbl 1010.90027] \textit{Clementi, Andrea E. F.; Crescenzi, Pilu; Monti, Angelo; Penna, Paolo; Silvestri, Riccardo}, On computing ad-hoc selective families, 211-222 [Zbl 1005.68521] \textit{Coppersmith, Don}, \(L\) infinity embeddings, 223-228 [Zbl 1001.05044] \textit{Dunagan, John; Vempala, Santosh}, On Euclidean embeddings and bandwidth minimization, 229-240 [Zbl 1001.05045] \textit{Engebretsen, Lars}, The non-approximability of non-Boolean predicates, 241-248 [Zbl 0998.68028] \textit{Klivans, Adam R.}, On the derandomization of constant depth circuits, 249-260 [Zbl 0998.68061] \textit{Parnas, Michal; Ron, Dana; Rubinfeld, Ronitt}, Testing parenthesis languages, 261-272 [Zbl 0998.68076] \textit{Parnas, Michal; Ron, Dana; Samorodnitsky, Alex}, Proclaiming dictators and juntas or testing Boolean formulae, 273-284 [Zbl 0998.68224] \textit{Pemmaraju, Sriram V.}, Equitable coloring extends Chernoff-Hoeffding bounds, 285-296 [Zbl 0998.68231]