1. Guest Editors' Introduction

   • K. Jansen
   • J. Rolim

   OriginalPaper Pages: 351 - 352

2. On Rooted Node-Connectivity Problems

   • J. Cheriyan
   • T. Jordán
   • Z. Nutov

   OriginalPaper Pages: 353 - 375

3. Random Sampling of Euler Tours

   • P. Tetali
   • S. Vempala

   OriginalPaper Pages: 376 - 385

4. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems

   • M. Karpinski

   OriginalPaper Pages: 386 - 397

5. Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint

   • M. I. Sviridenko

   OriginalPaper Pages: 398 - 405

6. An Approximation Algorithm for Circular Arc Colouring

   • V. Kumar

   OriginalPaper Pages: 406 - 417

7. Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols

   • M. Saks
   • S. Zhou

   OriginalPaper Pages: 418 - 431

8. On the Hardness of Approximating Spanners

   • G. Kortsarz

   OriginalPaper Pages: 432 - 450

9. Approximation of Geometric Dispersion Problems

   • C. Baur
   • S. P. Fekete

   OriginalPaper Pages: 451 - 470