Abstract is missing.
- Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization ProblemsMarek Karpinski. 1-14
- Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential ModelColin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe. 15-26
- Approximation Algorithms for Covering Polygons with Squares and Similar ProblemsChristos Levcopoulos, Joachim Gudmundsson. 27-41
- Greedily Approximating the r-independent Set and k-center Problems on Random InstancesBernd Kreuter, Till Nierhoff. 43-53
- Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric ProblemsSanjeev Arora. 55
- Random Sampling of Euler ToursPrasad Tetali, Santosh Vempala. 57-66
- A Combinatorial Consistency Lemma with Application to Proving the PCP TheoremOded Goldreich, Shmuel Safra. 67-84
- Super-bits, Demi-bits, and NP/qpoly-natural ProofsSteven Rudich. 85-93
- Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication ProtocolsMichael E. Saks, Shiyu Zhou. 95-109
- Approximation on the Web: A Compendium of NP Optimization ProblemsPierluigi Crescenzi, Viggo Kann. 111-118
- Random-Based Scheduling: New Approximations and LP Lower BoundsAndreas S. Schulz, Martin Skutella. 119-133
- Go with the winners Generators with Applications to Molecular ModelingMarcus Peinado, Thomas Lengauer. 135-149
- Probabilistic Approximation of Some NP Optimization Problems by Finite-State MachinesDawei Hong, Jean-Camille Birget. 151-164
- Using Hard Problems to Derandomize Algorithms: An Incomplete SurveyRussell Impagliazzo. 165-173
- Weak and Strong Recognition by 2-way Randomized AutomataAndris Ambainis, Rusins Freivalds, Marek Karpinski. 175-185
- Tally Languages Accepted by Monte Carlo Pushdown AutomataJanis Kaneps, Dainis Geidmanis, Rusins Freivalds. 187-195
- Resource-Bounded Randomness and Compressibility with Respect to Nonuniform MeasuresSteven M. Kautz. 197-211
- Randomness, Stochasticity and ApproximationsYongge Wang. 213-225