Matches in SemOpenAlex for { <https://semopenalex.org/work/W2762439698> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W2762439698 abstract "We study the following geometric separation problem: Given a set $R$ of red points and a set $B$ of blue points in the plane, find a minimum-size set of lines that separate $R$ from $B$. We show that, in its full generality, parameterized by the number of lines $k$ in the solution, the problem is unlikely to be solvable significantly faster than the brute-force $n^{O(k)}$-time algorithm, where $n$ is the total number of points. Indeed, we show that an algorithm running in time $f(k)n^{o(k/ log k)}$, for any computable function $f$, would disprove ETH. Our reduction crucially relies on selecting lines from a set with a large number of different slopes (i.e., this number is not a function of $k$). Conjecturing that the problem variant where the lines are required to be axis-parallel is FPT in the number of lines, we show the following preliminary result. Separating $R$ from $B$ with a minimum-size set of axis-parallel lines is FPT in the size of either set, and can be solved in time $O^*(9^{|B|})$ (assuming that $B$ is the smallest set)." @default.
- W2762439698 created "2017-10-20" @default.
- W2762439698 creator A5001427452 @default.
- W2762439698 creator A5059698872 @default.
- W2762439698 creator A5083806838 @default.
- W2762439698 date "2019-05-27" @default.
- W2762439698 modified "2023-10-01" @default.
- W2762439698 title "On the parameterized complexity of red-blue points separation" @default.
- W2762439698 cites W1507717186 @default.
- W2762439698 cites W2129889866 @default.
- W2762439698 cites W2624295525 @default.
- W2762439698 cites W2773541059 @default.
- W2762439698 hasPublicationYear "2019" @default.
- W2762439698 type Work @default.
- W2762439698 sameAs 2762439698 @default.
- W2762439698 citedByCount "1" @default.
- W2762439698 countsByYear W27624396982016 @default.
- W2762439698 crossrefType "journal-article" @default.
- W2762439698 hasAuthorship W2762439698A5001427452 @default.
- W2762439698 hasAuthorship W2762439698A5059698872 @default.
- W2762439698 hasAuthorship W2762439698A5083806838 @default.
- W2762439698 hasBestOaLocation W27624396982 @default.
- W2762439698 hasConcept C105795698 @default.
- W2762439698 hasConcept C114614502 @default.
- W2762439698 hasConcept C165464430 @default.
- W2762439698 hasConcept C2776061190 @default.
- W2762439698 hasConcept C33923547 @default.
- W2762439698 hasConceptScore W2762439698C105795698 @default.
- W2762439698 hasConceptScore W2762439698C114614502 @default.
- W2762439698 hasConceptScore W2762439698C165464430 @default.
- W2762439698 hasConceptScore W2762439698C2776061190 @default.
- W2762439698 hasConceptScore W2762439698C33923547 @default.
- W2762439698 hasLocation W27624396981 @default.
- W2762439698 hasLocation W27624396982 @default.
- W2762439698 hasLocation W27624396983 @default.
- W2762439698 hasLocation W27624396984 @default.
- W2762439698 hasLocation W27624396985 @default.
- W2762439698 hasLocation W27624396986 @default.
- W2762439698 hasLocation W27624396987 @default.
- W2762439698 hasLocation W27624396988 @default.
- W2762439698 hasLocation W27624396989 @default.
- W2762439698 hasOpenAccess W2762439698 @default.
- W2762439698 hasPrimaryLocation W27624396981 @default.
- W2762439698 hasRelatedWork W1978042415 @default.
- W2762439698 hasRelatedWork W2016352533 @default.
- W2762439698 hasRelatedWork W2017331178 @default.
- W2762439698 hasRelatedWork W242849172 @default.
- W2762439698 hasRelatedWork W2780415142 @default.
- W2762439698 hasRelatedWork W2950011768 @default.
- W2762439698 hasRelatedWork W2976797620 @default.
- W2762439698 hasRelatedWork W2996901643 @default.
- W2762439698 hasRelatedWork W3086542228 @default.
- W2762439698 hasRelatedWork W4300069928 @default.
- W2762439698 isParatext "false" @default.
- W2762439698 isRetracted "false" @default.
- W2762439698 magId "2762439698" @default.
- W2762439698 workType "article" @default.