BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-88-1225
       ENTRY:: April 24, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Parallel Approximation Algorithms
        TYPE:: Technical Report
      AUTHOR:: Mayr, Ernst W.
        DATE:: September 1988
       PAGES:: 20
    ABSTRACT:: Many problems of great practical importance are hard to solve
               computationally, at least if exact solutions are required. We
               survey a number of (NP- or P-complete) problems for which
               fast parallel approximation algorithms are known: The 0-1
               knapsack problem, binpacking, the minimal makeshift problem,
               the list scheduling problem, greedy scheduling, and the high
               density subgraph problem. Algorithms for these problems are
               presented highlighting the underlying techniques and
               principles, and several types of parallel approximation
               schemes are exhibited.
       NOTES:: [Adminitrivia V1/Prg/19950424]
         END:: STAN//CS-TR-88-1225