The complexity of geodesic spanners
A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q \in S$ is at most $t$ times the original distance between $p$ and $q$. We study geometric $t$-spanners for point sets in a constrained two-dimensional envi...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Carleton University
2024-10-01
|
| Saila: | Journal of Computational Geometry |
| Sarrera elektronikoa: | https://jocg.org/index.php/jocg/article/view/4774 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|