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

Research output: Contribution to journalArticleResearchpeer-review

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

Fingerprint

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
Subgraph
Cardinality
Euclidean
Radius

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

Cite this

@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 = "Maik Nauka-Interperiodica Publishing",

}

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

In: Proceedings of the Steklov Institute of Mathematics, Vol. 303, 01.12.2018, p. 146-155.

Research output: Contribution to journalArticleResearchpeer-review

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

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

U2 - 10.1134/S0081543818090158

DO - 10.1134/S0081543818090158

M3 - Article

VL - 303

SP - 146

EP - 155

JO - Proceedings of the Steklov Institute of Mathematics

JF - Proceedings of the Steklov Institute of Mathematics

SN - 0081-5438

ER -