# Approximability of covering cells with line segments

Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz, Xavier da Silveira

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

## תקציר

In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set S of n line segments in the plane, find a minimum number of line segments such that every cell in the arrangement of the line segments is covered. Here, a line segment s covers a cell f if s is incident to f. The problem was shown to be NP-hard, even if the line segments in S are axis-parallel, and it remains NP-hard when the goal is cover the "rectangular" cells (i.e., cells that are defined by exactly four axis-parallel line segments). In this paper, we consider the approximability of the problem. We first give a PTAS for the problem when the line segments in S are in any orientation, but we can only select the covering line segments from one orientation. Then, we show that when the goal is to cover the rectangular cells using line segments from both horizontal and vertical line segments, then the problem is APX-hard. We also consider the parameterized complexity of the problem and prove that the problem is FPT when parameterized by the size of an optimal solution. Our FPT algorithm works when the line segments in S have two orientations and the goal is to cover all cells, complementing that of Korman et al. [9] in which the goal is to cover the "rectangular" cells.

שפה מקורית אנגלית אמריקאית Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Proceedings Alexander Zelikovsky, Donghyun Kim, R.N. Uma Springer Verlag 436-448 13 9783030046507 https://doi.org/10.1007/978-3-030-04651-4_29 פורסם - 1 ינו׳ 2018 12th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2018 - Atlanta, ארצות הבריתמשך הזמן: 15 דצמ׳ 2018 → 17 דצמ׳ 2018

### סדרות פרסומים

שם Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11346 LNCS

### כנס

כנס 12th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2018 ארצות הברית Atlanta 15/12/18 → 17/12/18

## ASJC Scopus subject areas

• ???subjectarea.asjc.2600.2614???
• ???subjectarea.asjc.1700.1700???

## טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Approximability of covering cells with line segments'. יחד הם יוצרים טביעת אצבע ייחודית.