Min-Power Covering Problems Full article
Conference |
The 26th International Symposium on Algorithms and Computation 09-11 Dec 2015 , Нагойя, Япония |
||||||||
---|---|---|---|---|---|---|---|---|---|
Source | Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science. Compilation, Springer. Berlin, Heidelberg.2015. 786 c. |
||||||||
Journal |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||||||
Output data | Year: 2015, Volume: 9472, Pages: 367-377 Pages count : 11 DOI: 10.1007/978-3-662-48971-0_32 | ||||||||
Authors |
|
||||||||
Affiliations |
|
Cite:
Angel E.
, Bampis E.
, Chau V.
, Kononov A.
Min-Power Covering Problems
In compilation Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science.. – Springer., 2015. – Т.9472. – C.367-377. DOI: 10.1007/978-3-662-48971-0_32 Scopus РИНЦ OpenAlex
Min-Power Covering Problems
In compilation Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science.. – Springer., 2015. – Т.9472. – C.367-377. DOI: 10.1007/978-3-662-48971-0_32 Scopus РИНЦ OpenAlex
Dates:
Published print: | Nov 27, 2015 |
Identifiers:
Scopus: | 2-s2.0-84951924829 |
Elibrary: | 26927958 |
OpenAlex: | W2407680873 |