Enviar artigo por via de e-mail FPT-Algorithm for Computing the Width of a Simplex Given by a Convex Hull
- Autores: Veselov S.I.1, Gribanov D.V.1, Malyshev D.S.2
-
Afiliações:
- Institute of Information Technologies, Mathematics, and Mechanics
- Faculty of Informatics, Mathematics and Computer Science
- Edição: Volume 43, Nº 1 (2019)
- Páginas: 1-11
- Seção: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176271
- DOI: https://doi.org/10.3103/S0278641919010084
- ID: 176271
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
The problem of computing the width of simplices generated by the convex hull of their integer vertices is considered. An FPT algorithm, in which the parameter is the maximum absolute value of the rank minors of the matrix consisting from the simplex vertices, is presented.
Palavras-chave
Sobre autores
S. Veselov
Institute of Information Technologies, Mathematics, and Mechanics
Autor responsável pela correspondência
Email: sergey.veselov@itmm.unn.ru
Rússia, Nizhny Novgorod, 603950
D. Gribanov
Institute of Information Technologies, Mathematics, and Mechanics
Autor responsável pela correspondência
Email: dimitry.gribanov@gmail.com
Rússia, Nizhny Novgorod, 603950
D. Malyshev
Faculty of Informatics, Mathematics and Computer Science
Autor responsável pela correspondência
Email: dsmalyshev@rambler.ru
Rússia, Nizhny Novgorod, 603155
Arquivos suplementares
