Pages that link to "Item:Q2285135"
From MaRDI portal
The following pages link to Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135):
Displaying 8 items.
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs (Q6591461) (← links)