New pairwise spanners (Q1693988): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Error Amplification for Pairwise Spanner Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 4/3 additive spanner exponent is tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Polynomial Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and (α, β)-spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Distance Preservers and Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Distance Preservers and Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing with Minimum Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact roundtrip routing in directed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Pairwise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Pairwise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Stretch Pairwise Spanners and Approximate $D$-Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Spanners: A Simple Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity-preserving labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners and emulators with sublinear distance errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Spanners in Nearly Quadratic Time / rank
 
Normal rank

Latest revision as of 01:54, 15 July 2024

scientific article
Language Label Description Also known as
English
New pairwise spanners
scientific article

    Statements

    New pairwise spanners (English)
    0 references
    1 February 2018
    0 references
    Let \(G=(V,E)\) be an undirected unweighted graph on \(n\) vertices. A subgraph \(H\) of \(G\) is called an (all-pairs) purely additive spanner with stretch \(\beta\) if for every \((u,v)\in V\times V\), \(\operatorname{dist}_H(u,v)\leq \operatorname{dist}_G(u,v)+\beta\). The following problem is considered in this paper. Given \(\mathcal{P}\subseteq V\times V\) then seek a sparse subgraph \(H\) where \(\operatorname{dist}_H(u,v)\leq \operatorname{dist}_G(u,v)+\beta\) for each \((u,v)\in \mathcal{P}\). Such a subgraph is called a pairwise spanner with additive stretch \(\beta\). This paper discusses sparse pairwise spanners with additive stretches \(4\) and \(6\) and also the following special cases \(\mathcal{P}=S\times V\) and \(\mathcal{P}=S\times T\), where \(S\subseteq V\) and \(T\subseteq V\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    undirected graphs
    0 references
    shortest paths, approximate distances, additive stretch, spanners
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references