Pages that link to "Item:Q5283364"
From MaRDI portal
The following pages link to On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364):
Displaying 5 items.
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- The hardness and approximation of the star \(p\)-hub center problem (Q1949676) (← 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)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)