Pages that link to "Item:Q2817864"
From MaRDI portal
The following pages link to Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs (Q2817864):
Displaying 8 items.
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- Approximation algorithms for median hub location problems (Q2424817) (← links)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
- (Q3046493) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)