Low-light trees, and tight lower bounds for Euclidean spanners (Q972609): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compact routing on euclidian metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient construction of a bounded-degree spanner with low weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing to Multiple Destinations in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing plane spanners of bounded degree and low weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small hop-diameter sparse spanners for doubling metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-separated pair decomposition in linear time? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>l</i><sup>2</sup><sub>2</sub> spreading metrics for vertex ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-stretch spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231911 / 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: An improved approximation ratio for the minimum linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse communication networks and efficient routing in the plane (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Multi-Destination Routing: The Constraints of Local Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-hop minimum spanning trees in Euclidean metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128917 / rank
 
Normal rank

Latest revision as of 21:02, 2 July 2024

scientific article
Language Label Description Also known as
English
Low-light trees, and tight lower bounds for Euclidean spanners
scientific article

    Statements

    Low-light trees, and tight lower bounds for Euclidean spanners (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    computational geometry
    0 references
    Euclidean spanners
    0 references
    hop-diameter
    0 references
    low distortion embeddings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references