An improved approximation algorithm for multiway cut

DMCA

An improved approximation algorithm for multiway cut (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gruia Călinescu , Howard Karloff , Yuval Rabani

Venue:	Journal of Computer and System Sciences
Citations:	71 - 5 self

BibTeX

@ARTICLE{Călinescu98animproved,
    author = {Gruia Călinescu and Howard Karloff and Yuval Rabani},
    title = {An improved approximation algorithm for multiway cut},
    journal = {Journal of Computer and System Sciences},
    year = {1998},
    volume = {60},
    pages = {48--52}
}

OpenURL

Abstract

Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due to Dahlhaus, � Johnson, Papadimitriou, Seymour, and Yannakakis gave a performance guarantee of 2 1 − 1 k. In this paper, we present a new linear programming relaxation for Multiway Cut and a new approximation algorithm based on it. The algorithm breaks the threshold of 2 for approximating Multiway Cut, achieving a. This improves the previous result for every value of k. performance ratio of at most 1.5 − 1 k In particular, for k = 3 we get a ratio of 7

Keyphrases

multiway cut improved approximation algorithm new linear programming relaxation performance ratio undirected graph edge cost performance guarantee new approximation algorithm simple combinatorial algorithm previous result minimum cost

DMCA