| Naslov: | Connectivity with uncertainty regions given as line segments |
|---|
| Avtorji: | ID Cabello, Sergio (Avtor)
ID Gajser, David (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (685,98 KB)
MD5: 17304811F1157DDF1FCA980BD1E379BD
 URL - Izvorni URL, za dostop obiščite https://link.springer.com/article/10.1007/s00453-023-01200-5
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | For a set ${\mathcal Q}$ of points in the plane and a real number $\delta \ge 0$, let $\mathbb{G}_\delta({\mathcal Q})$ be the graph defined on ${\mathcal Q}$ by connecting each pair of points at distance at most $\delta$. We consider the connectivity of $\mathbb{G}_\delta({\mathcal Q})$ in the best scenario when the location of a few of the points is uncertain, but we know for each uncertain point a line segment that contains it. More precisely, we consider the following optimization problem: given a set ${\mathcal P}$ of $n-k$ points in the plane and a set ${\mathcal S}$ of $k$ line segments in the plane, find the minimum $\delta \ge 0$ with the property that we can select one point $p_s\in s$ for each segment $s\in {\mathcal S}$ and the corresponding graph $\mathbb{G}_\delta( {\mathcal P}\cup \{ p_s\mid s\in {\mathcal S}\})$ is connected. It is known that the problem is NP-hard. We provide an algorithm to exactly compute an optimal solution in ${\mathcal O}(f(k) n \log n)$ time, for a computable function $f(\cdot)$. This implies that the problem is FPT when parameterized by $k$. The best previous algorithm uses ${\mathcal O}((k!)^k k^{k+1}\cdot n^{2k})$ time and computes the solution up to fixed precision. |
|---|
| Ključne besede: | computational geometry, uncertainty, geometric optimization, fixed parameter tractability, parametric search |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 01.05.2024 |
|---|
| Leto izida: | 2024 |
|---|
| Št. strani: | str. 1512-1544 |
|---|
| Številčenje: | Vol. 86, iss. 5 |
|---|
| PID: | 20.500.12556/DiRROS-18913  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 0178-4617 |
|---|
| DOI: | 10.1007/s00453-023-01200-5 |
|---|
| COBISS.SI-ID: | 180364547 |
|---|
| Datum objave v DiRROS: | 13.05.2024 |
|---|
| Število ogledov: | 424 |
|---|
| Število prenosov: | 312 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
