Diskretn. Anal. Issled. Oper., 2015, Volume 22, Number 4

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2015, Volume 22, Number 4

	Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded from below E. Kh. Gimadi, E. Yu. Shin		5
	About density of a covering of a strip with identical sectors A. I. Erzin, N. A. Shabelnikova		21
	The complexity of the project scheduling problem with credits E. A. Kazakovtseva, V. V. Servakh		35
	An exact pseudopolynomial algorithm for a bi-partitioning problem A. V. Kel'manov, V. I. Khandeev		50
	Effective algorithms for one scheduling problem on two machines with makespan minimization A. A. Romanova		63