A Perfect Speedup Parallel Algorithm For The Assignment Problem On Complete Weighted Bipartite Graphs
Download A Perfect Speedup Parallel Algorithm For The Assignment Problem On Complete Weighted Bipartite Graphs PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get A Perfect Speedup Parallel Algorithm For The Assignment Problem On Complete Weighted Bipartite Graphs book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs
Abstract: "Parallel algorithms for special cases of the assignment problem have been designed. These algorithms assume the edge weights are integers and within a range. In one case the algorithm is good if the maximum of the absolute values of the edge weights is polynomial in the number of verticies, n. In another case the time-processor product exceeds the running time for best sequential algorithm for the assignment problem
Assignment Problems, Revised Reprint
Assignment Problems is a useful tool for researchers, practitioners and graduate students. In 10 self-contained chapters, it provides a comprehensive treatment of assignment problems from their conceptual beginnings through present-day theoretical, algorithmic and practical developments. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems and many variations of these. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in areas related to discrete mathematics and combinatorial optimisation. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography.
ICCI '92, Fourth International Conference on Computing and Information, May 28-30, 1992, Toronto, Ontario
The conference, held in Toronto in May of 1992, covered topics that include expert systems, theory of programming, concurrency, CASE methodology, and distributed computing. No index. Annotation copyright Book News, Inc. Portland, Or.