FPT-Algorithm for Computing the Width of a Simplex Given by a Convex Hull

摘要

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.