Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Combinatorial properties and complexity of a max-cut approximation
European Journal of Combinatorics
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Integer Linear Programs and Local Search for Max-Cut
SIAM Journal on Computing
ACM Computing Surveys (CSUR)
How good is the Goemans-Williamson MAX CUT algorithm?
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP)
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A Randomized Approximation Scheme for Metric MAX-CUT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the Hardness of Approximating Max k-Cut and Its Dual
On the Hardness of Approximating Max k-Cut and Its Dual
| Hi-index | 0.00 |
We deal with the maximum cut problem on cubic graphs and we present a simple O(log n) time parallel algorithm, running on a CRCW PRAM with O(n) processors. The approximation ratio of our algorithm is 1:3 and improves the best known parallel approximation ratio, i.e. 2, in the special case of cubic graphs.