Constant factor approximation for intersecting line segments with disks

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationLearning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers
EditorsPanos M. Pardalos, Roberto Battiti, Mauro Brunato, Ilias Kotsireas
PublisherSpringer Verlag
Pages447-454
Number of pages8
ISBN (Print)9783030053475
DOIs
Publication statusPublished - 1 Jan 2019
Event12th International Conference on Learning and Intelligent Optimization, LION 12 - Kalamata, Greece
Duration: 10 Jun 201815 Jun 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11353 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Learning and Intelligent Optimization, LION 12
CountryGreece
CityKalamata
Period10/06/201815/06/2018

Fingerprint

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

Keywords

  • Approximation algorithms
  • Computational geometry
  • Epsilon nets
  • Hitting set problem
  • Line segments

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kobylkin, K. (2019). Constant factor approximation for intersecting line segments with disks. In P. M. Pardalos, R. Battiti, M. Brunato, & I. Kotsireas (Eds.), Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers (pp. 447-454). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 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. editor / Panos M. Pardalos ; Roberto Battiti ; Mauro Brunato ; Ilias Kotsireas. Springer Verlag, 2019. pp. 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. in PM Pardalos, R Battiti, M Brunato & I Kotsireas (eds), 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), vol. 11353 LNCS, Springer Verlag, pp. 447-454, 12th International Conference on Learning and Intelligent Optimization, LION 12, Kalamata, Greece, 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. ed. / Panos M. Pardalos; Roberto Battiti; Mauro Brunato; Ilias Kotsireas. Springer Verlag, 2019. p. 447-454 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11353 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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. In Pardalos PM, Battiti R, Brunato M, Kotsireas I, editors, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer Verlag. 2019. p. 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