Pages that link to "Item:Q4710684"

The following pages link to A trade-off between space and efficiency for routing tables (Q4710684):

Displaying 50 items.

• Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
• On the efficiency of routing in sensor networks (Q455964) (← links)
• Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
• Spanners in sparse graphs (Q657919) (← links)
• \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
• Average stretch analysis of compact routing schemes (Q875595) (← links)
• Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
• Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
• Multidimensional interval routing schemes (Q1275073) (← links)
• Graph theoretical issues in computer networks (Q1319540) (← links)
• Restrictions of minimum spanner problems (Q1370655) (← links)
• Interval routing in some planar networks. (Q1401175) (← links)
• The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
• A survey on interval routing (Q1575744) (← links)
• Static and dynamic low-congested interval routing schemes (Q1605315) (← links)
• Tree spanners of bounded degree graphs (Q1693164) (← links)
• On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
• Routing in unit disk graphs (Q1742368) (← links)
• Interval routing in reliability networks (Q1770375) (← links)
• NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
• The compactness of adaptive routing tables (Q1827290) (← links)
• A distributed algorithm to find \(k\)-dominating sets (Q1827867) (← links)
• The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
• Distance estimation and object location via rings of neighbors (Q1954208) (← links)
• A note on distance-preserving graph sparsification (Q2059887) (← links)
• Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
• Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
• Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
• Covering metric spaces by few trees (Q2168848) (← links)
• Routing in polygonal domains (Q2173455) (← links)
• The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
• Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
• Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
• Tree-decompositions with bags of small diameter (Q2370441) (← links)
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
• Bounding the locality of distributed routing algorithms (Q2375823) (← links)
• Proof labeling schemes (Q2377139) (← links)
• Spanners for bounded tree-length graphs (Q2383601) (← links)
• Distributed distance computation and routing with small messages (Q2422769) (← links)
• On additive spanners in weighted graphs with local error (Q2672448) (← links)
• Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
• Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
• Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
• Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
• Fault-Tolerant Compact Routing Schemes for General Graphs (Q3012912) (← links)
• Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
• A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
• Transitive-Closure Spanners: A Survey (Q4933368) (← links)
• The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)