|
Zapiski Nauchnykh Seminarov POMI, 2002, Volume 293, Pages 129–138
(Mi znsl1679)
|
|
|
|
This article is cited in 13 scientific papers (total in 13 papers)
A $2^{|E|/4}$-time Algorithm for MAX-CUT
A. S. Kulikov, S. S. Fedin Saint-Petersburg State University
Abstract:
In this paper we present an exact algorithm solving MAX-CUT in time $\operatorname{poly}(|E|)\cdot 2^{|E|/4}$, where $|E|$ is the number of edges (there can be multiple edges between two vertices). This bound improves the previously known bound $\operatorname{poly}(|E|)\cdot 2^{|E|/3}$ of Gramm et al. (2000).
Received: 08.12.2002
Citation:
A. S. Kulikov, S. S. Fedin, “A $2^{|E|/4}$-time Algorithm for MAX-CUT”, Computational complexity theory. Part VII, Zap. Nauchn. Sem. POMI, 293, POMI, St. Petersburg, 2002, 129–138; J. Math. Sci. (N. Y.), 126:3 (2005), 1200–1204
Linking options:
https://www.mathnet.ru/eng/znsl1679 https://www.mathnet.ru/eng/znsl/v293/p129
|
Statistics & downloads: |
Abstract page: | 290 | Full-text PDF : | 147 |
|