Constant factor approximation for intersecting line segments with disks

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

1 цитирование (Scopus)
Язык оригиналаАнглийский
Название основной публикацииLearning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers
РедакторыPanos M. Pardalos, Roberto Battiti, Mauro Brunato, Ilias Kotsireas
ИздательSpringer Verlag
Страницы447-454
Число страниц8
ISBN (печатное издание)9783030053475
DOI
СостояниеОпубликовано - 1 янв 2019
Событие12th International Conference on Learning and Intelligent Optimization, LION 12 - Kalamata, Греция
Продолжительность: 10 июн 201815 июн 2018

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

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

Конференция

Конференция12th International Conference on Learning and Intelligent Optimization, LION 12
СтранаГреция
ГородKalamata
Период10/06/201815/06/2018

Отпечаток

Line segment
Straight Line
Approximation algorithms
Approximation
Hitting Set
Line Drawing
Approximation Space
Planar graph
Approximation Algorithms
Subgraph
Cardinality
Radius
Arbitrary
Graph in graph theory

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

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

    • Theoretical Computer Science
    • Computer Science(all)

    Цитировать

    Kobylkin, K. (2019). Constant factor approximation for intersecting line segments with disks. В P. M. Pardalos, R. Battiti, M. Brunato, & I. Kotsireas (Ред.), Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers (стр. 447-454). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11353 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-05348-2_39
    Kobylkin, Konstantin. / Constant factor approximation for intersecting line segments with disks. Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. редактор / Panos M. Pardalos ; Roberto Battiti ; Mauro Brunato ; Ilias Kotsireas. Springer Verlag, 2019. стр. 447-454 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{328e671caa4f40e7be4287c0a265817e,
    title = "Constant factor approximation for intersecting line segments with disks",
    keywords = "Approximation algorithms, Computational geometry, Epsilon nets, Hitting set problem, Line segments",
    author = "Konstantin Kobylkin",
    year = "2019",
    month = "1",
    day = "1",
    doi = "10.1007/978-3-030-05348-2_39",
    language = "English",
    isbn = "9783030053475",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "447--454",
    editor = "Pardalos, {Panos M.} and Roberto Battiti and Mauro Brunato and Ilias Kotsireas",
    booktitle = "Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers",
    address = "Germany",

    }

    Kobylkin, K 2019, Constant factor approximation for intersecting line segments with disks. в PM Pardalos, R Battiti, M Brunato & I Kotsireas (ред.), Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 11353 LNCS, Springer Verlag, стр. 447-454, 12th International Conference on Learning and Intelligent Optimization, LION 12, Kalamata, Греция, 10/06/2018. https://doi.org/10.1007/978-3-030-05348-2_39

    Constant factor approximation for intersecting line segments with disks. / Kobylkin, Konstantin.

    Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. ред. / Panos M. Pardalos; Roberto Battiti; Mauro Brunato; Ilias Kotsireas. Springer Verlag, 2019. стр. 447-454 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11353 LNCS).

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

    TY - GEN

    T1 - Constant factor approximation for intersecting line segments with disks

    AU - Kobylkin, Konstantin

    PY - 2019/1/1

    Y1 - 2019/1/1

    KW - Approximation algorithms

    KW - Computational geometry

    KW - Epsilon nets

    KW - Hitting set problem

    KW - Line segments

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

    U2 - 10.1007/978-3-030-05348-2_39

    DO - 10.1007/978-3-030-05348-2_39

    M3 - Conference contribution

    SN - 9783030053475

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

    SP - 447

    EP - 454

    BT - Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers

    A2 - Pardalos, Panos M.

    A2 - Battiti, Roberto

    A2 - Brunato, Mauro

    A2 - Kotsireas, Ilias

    PB - Springer Verlag

    ER -

    Kobylkin K. Constant factor approximation for intersecting line segments with disks. В Pardalos PM, Battiti R, Brunato M, Kotsireas I, редакторы, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer Verlag. 2019. стр. 447-454. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-05348-2_39