Pages that link to "Item:Q4698355"

The following pages link to NEW SPARSENESS RESULTS ON GRAPH SPANNERS (Q4698355):

Displaying 50 items.

• Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
• The MST of symmetric disk graphs is light (Q425622) (← links)
• Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
• Geometric spanners for weighted point sets (Q634687) (← links)
• On dynamic shortest paths problems (Q639278) (← links)
• \( \delta \)-greedy \(t\)-spanner (Q824327) (← links)
• Sparse geometric graphs with small dilation (Q929746) (← links)
• Diameter-preserving spanning trees in sparse weighted graphs (Q968216) (← links)
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
• Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
• Edge-disjoint spanners in tori (Q1025482) (← links)
• On sparse spanners of weighted graphs (Q1196368) (← links)
• Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
• Constructing sparse spanners for most graphs in higher dimensions (Q1336765) (← links)
• Restrictions of minimum spanner problems (Q1370655) (← links)
• A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
• Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
• Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
• Spanners in randomly weighted graphs: independent edge lengths (Q2065765) (← links)
• Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
• Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
• Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
• Covering metric spaces by few trees (Q2168848) (← links)
• On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
• Efficient construction of a bounded-degree spanner with low weight (Q2365175) (← links)
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
• Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
• Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
• Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
• On additive spanners in weighted graphs with local error (Q2672448) (← links)
• Lattice Spanners of Low Degree (Q2795942) (← links)
• Lattice spanners of low degree (Q2821117) (← links)
• Lower bound for sparse Euclidean spanners (Q2921726) (← links)
• The emergence of sparse spanners and well-separated pair decomposition under anarchy (Q2968083) (← links)
• Spanners in Sparse Graphs (Q3521950) (← links)
• The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
• The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension (Q3644728) (← links)
• CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS (Q3986395) (← links)
• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (Q4818597) (← links)
• The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
• (Q5009588) (← links)
• Generating sparse spanners for weighted graphs (Q5056089) (← links)
• Truly Optimal Euclidean Spanners (Q5071083) (← links)
• Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
• Covering Metric Spaces by Few Trees (Q5091169) (← links)
• (Q5091190) (← links)
• Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
• (Q5116490) (← links)