Prioritized Metric Structures and Embedding (Q2941541): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2934632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in metric embedding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Labels with Optimal Local Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object location using path separators / 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: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic-Competitive Algorithm for the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metrical interpretation of superreflexivity in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners with Slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Distance Oracles with Improved Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prioritized Metric Structures and Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimension of almost spherical sections of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed approximation algorithms via probabilistic tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation and embedding using small sets of beacons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the distortion of embedding finite metric spaces in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for local versions of dimension reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Distance Oracles with Improved Query Time / rank
 
Normal rank

Latest revision as of 01:27, 16 July 2024

scientific article; zbMATH DE number 6898310
Language Label Description Also known as
English
Prioritized Metric Structures and Embedding
scientific article; zbMATH DE number 6898310

    Statements

    Prioritized Metric Structures and Embedding (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    4 July 2018
    0 references
    distance oracles
    0 references
    metric embedding
    0 references
    priorities
    0 references
    routing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references