Randomized Parallel Algorithms for Combinatorial Optimization

@inproceedings{Rajasekaran1998RandomizedPA,
  title={Randomized Parallel Algorithms for Combinatorial Optimization},
  author={Sanguthevar Rajasekaran and Jos{\'e} D. P. Rolim},
  year={1998}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 74 REFERENCES

The Factorization of Linear Graphs

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Tsantilas, Optimal routing algorithms for mesh connected processor

S. Rajasekaran, Th
  • arrays, Algorithmica
  • 1992
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

k k routing

S. Rajasekaran
  • k k sorting, and cut through routing on the mesh, Journal of Algorithms 19
  • 1995
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL