The following pages link to (Q5136270):
Displaying 12 items.
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
- Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs (Q2944488) (← links)
- Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
- (Q4598152) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
