Original language | English |
---|---|

Pages (from-to) | 146-155 |

Number of pages | 10 |

Journal | Proceedings of the Steklov Institute of Mathematics |

Volume | 303 |

DOIs | |

Publication status | Published - 1 Dec 2018 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Mathematics (miscellaneous)

### WoS ResearchAreas Categories

- Mathematics, Applied
- Mathematics

### Cite this

}

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

Research output: Contribution to journal › Article › Research › peer-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

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 -