Pages that link to "Item:Q5384008"

The following pages link to Approximating <i>k</i>-center in planar graphs (Q5384008):

Displaying 9 items.

• The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
• A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
• The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
• (Q5136270) (← links)
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)