The following pages link to (Q2754183):
Displaying 15 items.
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- The hardness of approximating spanner problems (Q2464336) (← links)
- Lowest-degree \(k\)-spanner: approximation and hardness (Q2830866) (← links)
- (Q2969610) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- (Q4537738) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner (Q4962219) (← links)
