Matches in SemOpenAlex for { <https://semopenalex.org/work/W4300767039> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W4300767039 abstract "A $t$-spanner of a graph $G$ is a subgraph $H$ in which all distances are preserved up to a multiplicative $t$ factor. A classical result of Althofer et al. is that for every integer $k$ and every graph $G$, there is a $(2k-1)$-spanner of $G$ with at most $O(n^{1+1/k})$ edges. But for some settings the more interesting notion is not the number of edges, but the degrees of the nodes. This spurred interest in and study of spanners with small maximum degree. However, this is not necessarily a robust enough objective: we would like spanners that not only have small maximum degree, but also have few nodes of large degree. To interpolate between these two extremes, in this paper we initiate the study of graph spanners with respect to the $ell_p$-norm of their degree vector, thus simultaneously modeling the number of edges (the $ell_1$-norm) and the maximum degree (the $ell_{infty}$-norm). We give precise upper bounds for all ranges of $p$ and stretch $t$: we prove that the greedy $(2k-1)$-spanner has $ell_p$ norm of at most $max(O(n), O(n^{(k+p)/(kp)}))$, and that this bound is tight (assuming the ErdH{o}s girth conjecture). We also study universal lower bounds, allowing us to give generic guarantees on the approximation ratio of the greedy algorithm which generalize and interpolate between the known approximations for the $ell_1$ and $ell_{infty}$ norm. Finally, we show that at least in some situations, the $ell_p$ norm behaves fundamentally differently from $ell_1$ or $ell_{infty}$: there are regimes ($p=2$ and stretch $3$ in particular) where the greedy spanner has a provably superior approximation to the generic guarantee." @default.
- W4300767039 created "2022-10-04" @default.
- W4300767039 creator A5043851880 @default.
- W4300767039 creator A5049161363 @default.
- W4300767039 creator A5053721837 @default.
- W4300767039 date "2019-03-18" @default.
- W4300767039 modified "2023-10-17" @default.
- W4300767039 title "The Norms of Graph Spanners" @default.
- W4300767039 doi "https://doi.org/10.48550/arxiv.1903.07418" @default.
- W4300767039 hasPublicationYear "2019" @default.
- W4300767039 type Work @default.
- W4300767039 citedByCount "0" @default.
- W4300767039 crossrefType "posted-content" @default.
- W4300767039 hasAuthorship W4300767039A5043851880 @default.
- W4300767039 hasAuthorship W4300767039A5049161363 @default.
- W4300767039 hasAuthorship W4300767039A5053721837 @default.
- W4300767039 hasBestOaLocation W43007670391 @default.
- W4300767039 hasConcept C114614502 @default.
- W4300767039 hasConcept C118615104 @default.
- W4300767039 hasConcept C120314980 @default.
- W4300767039 hasConcept C121332964 @default.
- W4300767039 hasConcept C132525143 @default.
- W4300767039 hasConcept C134306372 @default.
- W4300767039 hasConcept C17744445 @default.
- W4300767039 hasConcept C191795146 @default.
- W4300767039 hasConcept C199539241 @default.
- W4300767039 hasConcept C24890656 @default.
- W4300767039 hasConcept C2775997480 @default.
- W4300767039 hasConcept C2779585601 @default.
- W4300767039 hasConcept C2780990831 @default.
- W4300767039 hasConcept C33923547 @default.
- W4300767039 hasConcept C41008148 @default.
- W4300767039 hasConcept C42747912 @default.
- W4300767039 hasConcept C77553402 @default.
- W4300767039 hasConcept C80899671 @default.
- W4300767039 hasConcept C83833204 @default.
- W4300767039 hasConceptScore W4300767039C114614502 @default.
- W4300767039 hasConceptScore W4300767039C118615104 @default.
- W4300767039 hasConceptScore W4300767039C120314980 @default.
- W4300767039 hasConceptScore W4300767039C121332964 @default.
- W4300767039 hasConceptScore W4300767039C132525143 @default.
- W4300767039 hasConceptScore W4300767039C134306372 @default.
- W4300767039 hasConceptScore W4300767039C17744445 @default.
- W4300767039 hasConceptScore W4300767039C191795146 @default.
- W4300767039 hasConceptScore W4300767039C199539241 @default.
- W4300767039 hasConceptScore W4300767039C24890656 @default.
- W4300767039 hasConceptScore W4300767039C2775997480 @default.
- W4300767039 hasConceptScore W4300767039C2779585601 @default.
- W4300767039 hasConceptScore W4300767039C2780990831 @default.
- W4300767039 hasConceptScore W4300767039C33923547 @default.
- W4300767039 hasConceptScore W4300767039C41008148 @default.
- W4300767039 hasConceptScore W4300767039C42747912 @default.
- W4300767039 hasConceptScore W4300767039C77553402 @default.
- W4300767039 hasConceptScore W4300767039C80899671 @default.
- W4300767039 hasConceptScore W4300767039C83833204 @default.
- W4300767039 hasLocation W43007670391 @default.
- W4300767039 hasOpenAccess W4300767039 @default.
- W4300767039 hasPrimaryLocation W43007670391 @default.
- W4300767039 hasRelatedWork W2077251859 @default.
- W4300767039 hasRelatedWork W2302201961 @default.
- W4300767039 hasRelatedWork W2383129606 @default.
- W4300767039 hasRelatedWork W2809995963 @default.
- W4300767039 hasRelatedWork W2951883761 @default.
- W4300767039 hasRelatedWork W2964200445 @default.
- W4300767039 hasRelatedWork W3208948601 @default.
- W4300767039 hasRelatedWork W4299641271 @default.
- W4300767039 hasRelatedWork W4300199259 @default.
- W4300767039 hasRelatedWork W4300767039 @default.
- W4300767039 isParatext "false" @default.
- W4300767039 isRetracted "false" @default.
- W4300767039 workType "article" @default.