Abstract
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.\bar 3 \) and improves the best known parallel approximation ratio, i.e. 2, in the special case of cubic graphs.
This author was partially supported by the Italian National Research Council (CNR).
Part of this research has been done while visiting Dept. of Computer Science, University of Rome “La Sapienza”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Calamoneri, T.: Does Cubicity Help to Solve Problems Ph.D. Thesis, University of Rome “La Sapienza”,XI-2–97, 1997.
Cole, R. Vishkin, U.: Deterministic Coin Tossing with applications to optimal parallel list ranking, Information and Control, 70(1), pp. 32–53, 1986.
Delorme, C. Poljak, S.: Combinatorial properties and the complexity of a max-cut approximation, European Journal of Combinatorics, 14, pp. 313–333, 1993.
Fernandez de la Vega, W. Kenyon, C.: A Randomized Approximation Scheme for Metric MAX-CUT, IEEE Symposium on Foundations of Computer Science (FOCS98), 1998.
Frieze, A.M. Jerrum, M.: Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION, Algorithmica, 18(1), pp. 67–81, 1997.
Garey, M.R. Johnson, D.S.: Computers and Intractability: a Guide to Theory of NP-completeness, W.H.Freeman, 1979.
Garey, M.R. Johnson, D.S. Stockmayer, L.: Some Simplified NP Complete Graph Problems, Theor. Comput. Sci., 1, pp. 237–267, 1976.
Goemans, M.X. Williamson, D.P.: 878-Approximation Algorithms for MAX CUT and MAX 2SAT, Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing (STOC94), pp. 422–431, 1994.
Greenlaw, R. Petreschi, R.: Cubic graphs, ACM Computing Surveys, 27(4), pp. 471–495, 1995.
Jájá, J.: An Introduction to Parallel Algorithms. Addison Wesley, 1992.
Kann, V. Khanna, S. Lagergren, J. Panconesi, A.: On the Hardness of ApproximatingMax k-Cut and its Dual, Chicago Journal of Theoretical Computer Science, 1997.
Karlo_, H.: How Good is the Goemans-Williamson MAX CUT Algorithm?, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC96), pp. 427–434, 1996.
Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set, SIAM J. on Computing, 15, pp. 1036–1053, 1986.
Nesetril, J. Turzik, D.: Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP), Proc. of SOFSEM97: Theory and Practics of Informatics, LNCS 1338, pp. 70–81, 1997.
Papadimitriou, C.H. and Yannakakis, M.: Optimization, Approximation, and Complexity Classes, J. Comput. System Sci., 43, pp. 425–440, 1991.
Poljak, S.: Integer Linear Programs and Local Search for Max-Cut, SIAM Journal on Computing, 24(4), pp. 822–839, 1995.
Poljak, S. Tuza, Z.: The max-cut problem-a survey Special Year on Combinatorial Optimization, DIMACS series in Discrete Mathematics and Theoretical Computer Science, 1995.
Yannakakis, M.: Node-and Edge-Deletion NP-Complete Problems. Proc. 10th Annual ACM Symp. on the Theory of Comp. (STOC78), ACM New York, 1978, pp 253–264.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calamoneri, T., Finocchi, I., Petreschi, R., Manoussakis, Y. (1999). A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-46674-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66856-5
Online ISBN: 978-3-540-46674-1
eBook Packages: Springer Book Archive