On a problem of choosing elements in a family of sequences - Conference attendances

On a problem of choosing elements in a family of sequences Conference attendances

Language

Английский

Participant type

Секционный

Conference

12-я Международная конференция «Интеллектуализация обработки информации»
08-12 Oct 2018 , Гаэта

Authors

Mikhailova Liudmila ¹ , Kelmanov Alexander ^1,2 , Romanchenko Semyon ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

In this paper we consider following some discrete optimization problem induced by the remote monitoring of several moving objects with possible arbitrary displacements (permutations) of these objects. We present an exact polynomial-time algorithm with O(N5) running time for this problem.

Mikhailova L. , Kelmanov A. , Romanchenko S.
On a problem of choosing elements in a family of sequences
12-я Международная конференция «Интеллектуализация обработки информации» 08-12 Oct 2018