DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1995; 374 pp; hardcover Volume: 22 ISBN10: 0821802402 ISBN13: 9780821802403 List Price: US$114 Member Price: US$91.20 Order Code: DIMACS/22
 This book contains papers presented at the Workshop on Parallel Processing of Discrete Optimization Problems held at DIMACS in April 1994. The contents cover a wide spectrum of the most recent algorithms and applications in parallel processing of discrete optimization and related problems. Topics include parallel branch and bound algorithms, scalability, load balancing, parallelism and irregular data structures and scheduling task graphs on parallel machines. Applications include parallel algorithms for solving satisfiability problems, location problems, linear programming, quadratic and linear assignment problems. This book would be suitable as a textbook in advanced courses on parallel algorithms and combinatorial optimization. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and researchers in computer science, mathematics, engineering, and operations research. Table of Contents  C. Busch and M. Mavronicolas  Proving correctness for balancing networks
 A. Clementi, J. Rolim, and L. Kucera  A note on parallel randomized algorithms for searching problems
 R. Corrêa and A. Ferreira  Modeling parallel branchandbound for asynchronous implementations
 O. Damberg and A. Migdalas  A data parallel space dilation algorithm for the concentrator location problem
 A. Gerasoulis, J. Jiao, and T. Yang  A multistage approach for scheduling task graphs on parallel machines
 J. Gu  Parallel algorithms for satisfiability (SAT) problem
 G. Karypis, A. Gupta, and V. Kumar  Experiences with a parallel formulation of an interior point algorithm
 P. S. Laursen  Experiences with a synchronous parallel branch and bound algorithm
 N. R. Mahapatra and S. Dutt  New anticipatory load balancing strategies for parallel \(A^\ast\) algorithms
 B. Mikolajczak  A parallel algorithm for computing all homomorphisms of deterministic finite automata
 T. M. Niccum, J. Srivastava, B. Himatsingka, and J. Li  Query optimization and processing in parallel databases
 S. Pande and K. Psarris  Scheduling acyclic task graphs on distributed memory parallel architectures
 A. Reinefeld  Scalability of massively parallel depthfirst search
 C. Roucairol  On irregular data structures and asynchronous parallel branch and bound algorithms
 C. Schütt and J. Clausen  Parallel algorithms for the assignment problemAn experimental evaluation of three distributed algorithms
 J. M. Smith and K. Xu  Serial & parallel algorithms for QSP problems
