The following pages link to (Q2728855):
Displaying 10 items.
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
- On the positive-negative partial set cover problem (Q975452) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- The hardness of approximating spanner problems (Q2464336) (← links)
- (Q2754183) (← links)
- Lowest-degree \(k\)-spanner: approximation and hardness (Q2830866) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- (Q4537738) (← links)
- On the hardness of approximating spanners (Q5945922) (← links)