Pages that link to "Item:Q517791"
From MaRDI portal
The following pages link to The parameterized complexity of the shared center problem (Q517791):
Displaying 6 items.
- A polynomial time approximation scheme for the closest shared center problem (Q513292) (← links)
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642) (← links)
- Un nuevo resultado sobre la complejidad del problema delP-centro (Q3035114) (← links)
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (Q3760268) (← links)
- A Polynomial Time Approximation Scheme for the Closest Shared Center Problem (Q4925254) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)