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...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Carleton University
2024-10-01
|
| Seri Bilgileri: | Journal of Computational Geometry |
| Online Erişim: | https://jocg.org/index.php/jocg/article/view/4774 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|