Pages that link to "Item:Q1949676"
From MaRDI portal
The following pages link to The hardness and approximation of the star \(p\)-hub center problem (Q1949676):
Displaying 11 items.
- On the single-assignment \(p\)-hub center problem (Q1582051) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
- A combined average-case and worst-case analysis for an integrated hub location and revenue management problem (Q2296583) (← 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)
- Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs (Q2817864) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs (Q6591461) (← links)
