Pages that link to "Item:Q3902477"

The following pages link to On the computational complexity of centers locating in a graph (Q3902477):

Displaying 14 items.

• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
• Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
• Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• The multi-service center problem (Q1680546) (← links)
• Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm (Q1701611) (← links)
• \(\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)
• Deployment optimization of multi-hop wireless networks based on substitution graph (Q2293167) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
• The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)