NP-hardness of the Euclidean Max-Cut problem
type: Item
instance of: scholarly article
title: NP-hardness of the Euclidean Max-Cut problem
zbMATH Open document ID: 1307.90212
DOI: 10.1134/S1064562414030235
author: Alexander Ageev
author: A. V. Kel'manov
author: Artem Pyatkin
published in: Doklady Mathematics
publication date: 2014-11-14T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6369719
zbMATH Keywords: Euclidean space
zbMATH Keywords: lengths of the edges
MaRDI profile type: Publication
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
cites work: Q4737533
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Reducibility among Combinatorial Problems
cites work: Q4790416
cites work: Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
cites work: Estimation of Distribution Algorithm for the Max-Cut Problem
cites work: A randomized approximation scheme for metric MAX-CUT
cites work: On the complexity of a search for a subset of ``similar'' vectors
full work available at URL: s1064562414030235
OpenAlex ID: W2000311458
description: scientific article; zbMATH DE number 6369719