On the complexity of the problem of arrangement on a~line with constraints on minimum distances
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2005), pp. 11-14
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2005_12_a1,
author = {G. G. Zabudskii},
title = {On the complexity of the problem of arrangement on a~line with constraints on minimum distances},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {11--14},
publisher = {mathdoc},
number = {12},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/}
}
TY - JOUR AU - G. G. Zabudskii TI - On the complexity of the problem of arrangement on a~line with constraints on minimum distances JO - Izvestiâ vysših učebnyh zavedenij. Matematika PY - 2005 SP - 11 EP - 14 IS - 12 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/ LA - ru ID - IVM_2005_12_a1 ER -
G. G. Zabudskii. On the complexity of the problem of arrangement on a~line with constraints on minimum distances. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2005), pp. 11-14. http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/