Question
Consider the following algorithm for MaxCut problem: Given a given graph G=(V,E). Assume that in the beginning all nodes are unassigned, i.e. sets A,B are
Consider the following algorithm for MaxCut problem:
Given a given graph G=(V,E). Assume that in the beginning all nodes are unassigned, i.e. sets A,B are empty.
While there still are unassigned nodes remaining
Pick unassigned nod
Assign a node either to the set A or to the set B with equal probability 1/2.
Output cut (A,B).
What is the expected approximation ratio of this algorithm?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Microsoft Outlook 2023
Authors: James Holler
1st Edition
B0BP9P1VWJ, 979-8367217322
