Pages that link to "Item:Q5175965"

The following pages link to <i>(1 + εΒ)</i> -spanner constructions for general graphs (Q5175965):

Displaying 12 items.

• Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
• An approximation algorithm for the edge-dilation \(k\)-center problem. (Q703267) (← links)
• Interval routing in reliability networks (Q1770375) (← links)
• Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
• Spanners for bounded tree-length graphs (Q2383601) (← links)
• Network flow spanners (Q3057178) (← links)
• Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
• Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
• A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
• Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
• Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)