Stabbing line segments with disks: Complexity and approximation algorithms

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

2 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииAnalysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers
ИздательSpringer Verlag
Страницы356-367
Число страниц12
Том10716 LNCS
ISBN (печатное издание)9783319730127
DOI
СостояниеОпубликовано - 1 янв 2018
Событие6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017 - Moscow, Российская Федерация
Продолжительность: 27 июл 201729 июл 2017

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том10716 LNCS
ISSN (печатное издание)0302-9743
ISSN (электронное издание)1611-3349

Конференция

Конференция6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017
СтранаРоссийская Федерация
ГородMoscow
Период27/07/201729/07/2017

Отпечаток

Approximation algorithms
Line segment
Approximation Algorithms
Straight Line
Line Drawing
Network security
Triangulation
Planar graph
Computational complexity
Hardness
NP-hardness
Delaunay triangulation
Network Security
Network Design
Graph in graph theory
Linear Function
Subgraph
Cardinality
Euclidean
Computational Complexity

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

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

    • Theoretical Computer Science
    • Computer Science(all)

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

    • Компьютерные науки, Информационные системы
    • Компьютерные науки, Теория и методы

    Цитировать

    Kobylkin, K. (2018). Stabbing line segments with disks: Complexity and approximation algorithms. В Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers (Том 10716 LNCS, стр. 356-367). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10716 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-73013-4_33
    Kobylkin, Konstantin. / Stabbing line segments with disks: Complexity and approximation algorithms. Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Том 10716 LNCS Springer Verlag, 2018. стр. 356-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{ff473cd721ca4472980ecfb699c2ed39,
    title = "Stabbing line segments with disks: Complexity and approximation algorithms",
    keywords = "Approximation algorithms, Computational complexity, Continuous disk cover, Delaunay triangulations, Hitting set",
    author = "Konstantin Kobylkin",
    year = "2018",
    month = "1",
    day = "1",
    doi = "10.1007/978-3-319-73013-4_33",
    language = "English",
    isbn = "9783319730127",
    volume = "10716 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "356--367",
    booktitle = "Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers",
    address = "Germany",

    }

    Kobylkin, K 2018, Stabbing line segments with disks: Complexity and approximation algorithms. в Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. том. 10716 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 10716 LNCS, Springer Verlag, стр. 356-367, 6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017, Moscow, Российская Федерация, 27/07/2017. https://doi.org/10.1007/978-3-319-73013-4_33

    Stabbing line segments with disks: Complexity and approximation algorithms. / Kobylkin, Konstantin.

    Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Том 10716 LNCS Springer Verlag, 2018. стр. 356-367 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10716 LNCS).

    Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

    TY - GEN

    T1 - Stabbing line segments with disks: Complexity and approximation algorithms

    AU - Kobylkin, Konstantin

    PY - 2018/1/1

    Y1 - 2018/1/1

    KW - Approximation algorithms

    KW - Computational complexity

    KW - Continuous disk cover

    KW - Delaunay triangulations

    KW - Hitting set

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

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

    UR - https://elibrary.ru/item.asp?id=35496262

    U2 - 10.1007/978-3-319-73013-4_33

    DO - 10.1007/978-3-319-73013-4_33

    M3 - Conference contribution

    SN - 9783319730127

    VL - 10716 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 356

    EP - 367

    BT - Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers

    PB - Springer Verlag

    ER -

    Kobylkin K. Stabbing line segments with disks: Complexity and approximation algorithms. В Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Том 10716 LNCS. Springer Verlag. 2018. стр. 356-367. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-73013-4_33