Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks

K. S. Kobylkin

Результат исследований: Вклад в журнал › Статья › Научно-исследовательская › рецензирование

ЯзыкАнглийский
Страницы146-155
Число страниц10
ЖурналProceedings of the Steklov Institute of Mathematics
Том303
DOI
СостояниеОпубликовано - 1 дек 2018

Отпечаток

Line segment
Straight Line
Computational Complexity
Intersection
Line Drawing
NP-hardness
Plane Graph
Delaunay triangulation
Network Security
Polynomial Algorithm
Exact Algorithms
Network Design
Graph in graph theory
Min-max
Subgraph
Cardinality
Euclidean
Radius

Ключевые слова

    Предметные области ASJC Scopus

    • Mathematics (miscellaneous)

    Предметные области WoS

    • Математика, Прикладная
    • Математика

    Цитировать

    Kobylkin, K. S. / Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks. В: Proceedings of the Steklov Institute of Mathematics. 2018 ; Том 303. стр. 146-155.
    @article{c84adcc8ee594dca82eb2cbeaed3be5b,
    title = "Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks",
    keywords = "computational complexity, Continuous Disk Cover problem, Delaunay triangulations, Hitting Set problem",
    author = "Kobylkin, {K. S.}",
    year = "2018",
    month = "12",
    day = "1",
    doi = "10.1134/S0081543818090158",
    language = "English",
    volume = "303",
    pages = "146--155",
    journal = "Proceedings of the Steklov Institute of Mathematics",
    issn = "0081-5438",
    publisher = "Pleiades Publishing",

    }

    Kobylkin, KS 2018, 'Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks', Proceedings of the Steklov Institute of Mathematics, том. 303, стр. 146-155. https://doi.org/10.1134/S0081543818090158

    Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks. / Kobylkin, K. S.

    В: Proceedings of the Steklov Institute of Mathematics, Том 303, 01.12.2018, стр. 146-155.

    Результат исследований: Вклад в журнал › Статья › Научно-исследовательская › рецензирование

    TY - JOUR

    T1 - Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks

    AU - Kobylkin, K. S.

    PY - 2018/12/1

    Y1 - 2018/12/1

    KW - computational complexity

    KW - Continuous Disk Cover problem

    KW - Delaunay triangulations

    KW - Hitting Set problem

    UR - http://www.scopus.com/inward/record.url?scp=85062535849&partnerID=8YFLogxK

    UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000460791000015

    U2 - 10.1134/S0081543818090158

    DO - 10.1134/S0081543818090158

    M3 - Article

    VL - 303

    SP - 146

    EP - 155

    JO - Proceedings of the Steklov Institute of Mathematics

    T2 - Proceedings of the Steklov Institute of Mathematics

    JF - Proceedings of the Steklov Institute of Mathematics

    SN - 0081-5438

    ER -

    Kobylkin KS. Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks. Proceedings of the Steklov Institute of Mathematics. 2018 Дек. 1;303:146-155. https://doi.org/10.1134/S0081543818090158

    Ссылки