𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Continuation Algorithm for Max-Cut Problem

✍ Scribed by Feng Min Xu; Cheng Xian Xu; Xing Si Li

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2006
Tongue
English
Weight
160 KB
Volume
23
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A 2|E|/4-time algorithm for MAX-CUT
A 2|E|/4-time algorithm for MAX-CUT
✍ A. S. Kulikov; S. S. Fedin πŸ“‚ Article πŸ“… 2005 πŸ› Springer US 🌐 English βš– 144 KB
A discrete filled function algorithm for
A discrete filled function algorithm for approximate global solutions of max-cut problems
✍ Ai-Fan Ling; Cheng-Xian Xu; Feng-Min Xu πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 245 KB

A discrete filled function algorithm is proposed for approximate global solutions of max-cut problems. A new discrete filled function is defined for max-cut problems and the properties of the filled function are studied. Unlike general filled function methods, using the characteristic of max-cut pro

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