The following pages link to Lower-Stretch Spanning Trees (Q3624378):
Displayed 15 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Terminal embeddings (Q2405893) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- The DFS Fused Lasso: Linear-Time Denoising over General Graphs (Q4558501) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)