The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles

The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles Full article

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2018, Volume: 11353, Pages: 131-140 Pages count : 10 DOI: 10.1007/978-3-030-05348-2_11

Authors

Erzin Adil ^1,2 , Plotnikov R. ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Erzin A. , Plotnikov R.
The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles
Lecture Notes in Computer Science. 2018. V.11353. P.131-140. DOI: 10.1007/978-3-030-05348-2_11 Scopus OpenAlex

Scopus:	2-s2.0-85059950593
OpenAlex:	W2908088439

DB	Citing
OpenAlex	1