搜索页_ A. V. Kel’manov

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

外文资源

SpringerLink电子期刊(23)

在“SpringerLink电子期刊”中，命中：23条，耗时：小于0.01 秒

在所有数据库中总计命中：23条

1. Exact pseudopolynomial algorithm for one sequence partitioning problem

作者： A. V. Kel’manov ; S. A. Khamidullin ; V. I. Khandeev

关键词：Key wordspartition ; sequence of vectors ; Euclidean space ; minimal sum of squared distances ; NP ; hardness ; exact pseudopolynomial algorithm

刊名：Automation and Remote Control

出版年：2017

2. On the complexity of some Euclidean optimal summing problems

作者： A. V. Eremeev ; A. V. Kel’manov ; A. V. Pyatkin

刊名：Doklady Mathematics

出版年：2016

3. Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem

作者： A. V. Kel'manov ; V. I. Khandeev

关键词：cluster analysis ; partition ; Euclidean space ; minimum of the sum of squares of distances ; NP ; hardness ; fixed space dimension ; FPTAS

刊名：Computational Mathematics and Mathematical Physics

出版年：2016

4. Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters

作者： A. V. Dolgushev ; A. V. Kel’manov…

关键词：cluster analysis ; Euclidean space ; NP ; hard problem ; PTAS

刊名：Proceedings of the Steklov Institute of Mathematics

出版年：2016

5. On the complexity and approximability of some Euclidean optimal summing problems

作者： A. V. Eremeev ; A. V. Kel’manov…

关键词：Euclidean space ; cluster analysis ; search for a subset ; norm of sum ; NP ; hardness ; pseudopolynomial solvability ; discrete optimization problems

刊名：Computational Mathematics and Mathematical Physics

出版年：2016

6. On the complexity of some quadratic Euclidean 2-clustering problems

作者： A. V. Kel’manov ; A. V. Pyatkin

刊名：Computational Mathematics and Mathematical Physics

出版年：2016

7. Exact pseudopolynomial algorithms for a balanced 2-clustering problem

作者： A. V. Kel’manov ; A. V. Motkova

刊名：Journal of Applied and Industrial Mathematics

出版年：2016

8. On the complexity of some Euclidean problems of partitioning a finite set of points

作者： A. V. Kel’manov ; A. V. Pyatkin

刊名：Doklady Mathematics

出版年：2016

9. NP-hardness of some Quadratic Euclidean 2-clustering problems

作者： A. V. Kel’manov ; A. V. Pyatkin

刊名：Doklady Mathematics

出版年：2015

10. Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph

作者： E. Kh. Gimadi ; A. V. Kel’manov…

关键词：search for vertex ; disjoint cliques ; minimum total weight of vertices and edges ; approximation algorithm ; performance guarantee ; attainable bounds ; metric problem ; quadratic Euclidean problem

刊名：Proceedings of the Steklov Institute of Mathematics

出版年：2015

按检索点细分(23)

作者(23)

文摘(2)

按出版年细分(23)

2017年(1)

2016年(7)

2015年(5)

2014年(6)

2013年(3)

2012年(1)