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

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)146-155
Number of pages10
JournalProceedings of the Steklov Institute of Mathematics
Volume303
DOIs
Publication statusPublished - 1 Dec 2018

Keywords

  • computational complexity
  • Continuous Disk Cover problem
  • Delaunay triangulations
  • Hitting Set problem

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

WoS ResearchAreas Categories

  • Mathematics, Applied
  • Mathematics

GRNTI

  • 27.00.00 MATHEMATICS

Level of Research Output

  • VAK List

Fingerprint Dive into the research topics of 'Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks'. Together they form a unique fingerprint.

Cite this