Pages that link to "Item:Q5116483"
From MaRDI portal
The following pages link to The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483):
Displaying 7 items.
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
