Fast parallel approximations of the maximum weighted cut problem through derandomization
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A New Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1989
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974
- Pairwise Statistical IndependenceThe Annals of Mathematical Statistics, 1965