Pages that link to "Item:Q557826"
From MaRDI portal
The following pages link to Approximating \(k\)-spanner problems for \(k>2\) (Q557826):
Displaying 12 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Activity preserving graph simplification (Q2435687) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
