𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exact algorithm for MAX-CUT in sparse graphs

✍ Scribed by F. Della Croce; M.J. Kaminski; V.Th. Paschos

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
148 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch and cut algorithm for the Stein
A branch and cut algorithm for the Steiner problem in graphs
✍ Lucena, A.; Beasley, J. E. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint