Pages that link to "Item:Q666662"
From MaRDI portal
The following pages link to Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662):
Displayed 10 items.
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- (Q5874516) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Generalized \(k\)-center: distinguishing doubling and highway dimension (Q6043186) (← links)
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center (Q6109001) (← links)
- Graph burning and non-uniform \(k\)-centers for small treewidth (Q6176547) (← links)