𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalizedk-multiway cut problems

✍ Scribed by Jiping Liu; Yuejian Peng; Cheng Zhao

Book ID
105645633
Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
244 KB
Volume
21
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The multi-multiway cut problem
The multi-multiway cut problem
✍ Adi Avidor; Michael Langberg πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 248 KB
A Simple Algorithm for the Planar Multiw
A Simple Algorithm for the Planar Multiway Cut Problem
✍ Wei-Chang Yeh πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota

Approximation Algorithms || Multiway Cut
Approximation Algorithms || Multiway Cut and k-Cut
✍ Vazirani, Vijay V. πŸ“‚ Article πŸ“… 2003 πŸ› Springer Berlin Heidelberg 🌐 English βš– 853 KB

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conΒ­ jecture that P -=/= NP, their

Minimum multiway cuts in trees
Minimum multiway cuts in trees
✍ PΓ©ter L. ErdΕ‘s; AndrΓ‘s Frank; LΓ‘szlΓ³ SzΓ©kely πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 667 KB

We compare three lower bounds for the minimum cardinality of a multiway cut in a graph separating a given set S of terminals. The main result is a relatively short algorithmic proof for a simplified version of a min-max theorem of the first and the third authors asserting that the best of the three