Paradigms for Fast Parallel Approximability

1. Introduction 2. Basic concepts 3. Extremal graph properties 4. Rounding, interval partitioning and separation 5. Primal-dual method 6. Graph decomposition 7. Further parallel approximations 8. Non-approximability 9. Syntactical defined phrases Appendix: Definition of problems Bibliography Index.