Randomized Parallel Algorithms for Combinatorial Optimization

Sanguthevar Rajasekaran () and José D. P. Rolim ()
Additional contact information
Sanguthevar Rajasekaran: University of Florida, Department of Computer and Information Science and Engineering
José D. P. Rolim: University of Geneva, Centre Universitaire d’Informatique

A chapter in Handbook of Combinatorial Optimization, 1998, pp 2039-2092 from Springer

Abstract: Abstract In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth first search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomization and approximation, showing how randomization yields approximate solutions and we illustrate this connection by means of network flow problems.

Keywords: Perfect Match; Parallel Algorithm; Weighted Graph; Disjoint Path; Queue Size (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_32

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_32

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().