A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem

A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem Full article

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2016, Pages: 182-192 Pages count : 11 DOI: 10.1007/978-3-319-44914-2_15

Authors

Kel’manov Alexander ^1,2 , Motkova Anna ²

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel’manov A. , Motkova A.
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
Lecture Notes in Computer Science. 2016. P.182-192. DOI: 10.1007/978-3-319-44914-2_15 Scopus OpenAlex

Scopus:	2-s2.0-84988037221
OpenAlex:	W2559584927

DB	Citing
OpenAlex	15
Scopus	16