𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A 2|E|/4-time algorithm for MAX-CUT

✍ Scribed by A. S. Kulikov; S. S. Fedin

Publisher
Springer US
Year
2005
Tongue
English
Weight
144 KB
Volume
126
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Continuation Algorithm for Max-Cut Pro
A Continuation Algorithm for Max-Cut Problem
✍ Feng Min Xu; Cheng Xian Xu; Xing Si Li πŸ“‚ Article πŸ“… 2006 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 160 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