A 2-Approximation Algorithm for the Graph 2-Clustering Problem Full article
| Conference |
18th International conference on mathematical optimization theory and operations research 08-12 Jul 2019 , Екатеринбург |
||||
|---|---|---|---|---|---|
| Source | Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings Compilation, Springer. 2019. 716 c. ISBN 978-3-030-22628-2. |
||||
| Journal |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
| Output data | Year: 2019, Volume: 11558, Pages: 295-308 Pages count : 14 DOI: 10.1007/978-3-030-22629-9_21 | ||||
| Tags | Graph clustering, Approximation algorithm, Perfomance guarantee | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Il'ev V.
, Il’eva S.
, Morshinin A.
A 2-Approximation Algorithm for the Graph 2-Clustering Problem
In compilation Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.295-308. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_21 Scopus РИНЦ OpenAlex
A 2-Approximation Algorithm for the Graph 2-Clustering Problem
In compilation Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.295-308. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_21 Scopus РИНЦ OpenAlex
Dates:
| Published online: | Jun 12, 2019 |
Identifiers:
| Scopus: | 2-s2.0-85067669755 |
| Elibrary: | 45221589 |
| OpenAlex: | W2949146652 |