An improved approximation algorithm for requirement cut

An improved approximation algorithm for requirement cut

This note presents improved approximation guarantees for the requirement cut problem: given an n-vertex edge-weighted graph G = (V , E), and g groups of vertices X1, . . . , Xg ⊆ V with each group Xi having a requirement ri between 0 and |Xi|, the goal is to find aminimum cost set of edges whose removal separates each group Xi into at least ri disconnected components. We give a tightΘ(log g) ap...

Improved Approximation Algorithm for Requirement Cut

This note presents improved approximation guarantees for the requirement cut problem: given an n-vertex edge-weighted graph G = (V,E), g groups of vertices X1, · · · , Xg ⊆ V with each group Xi having a requirement ri between 0 and |Xi|, the goal is to find a minimum cost set of edges whose removal separates each group Xi into at least ri disconnected components. We give a tight Θ(log g) approx...

An Efficient Approximation Algorithm for Max-Cut

Significant research effort has been devoted in the study of approximation algorithms for NP-hard problems. Ap-proximation algorithm for Max-Cut problem with performance guarantee of 0. 87856 is long known. In this work we study balanced Max-Cut problem. We give a balancing factor ? for given ? such that the approximate solution is at least 0. 87856 times the optimal ?-balanced cut and it is it...

Approximation Algorithm for Maximum Cut

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...