Pages that link to "Item:Q3902477"

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

Displaying 6 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)
• The multi-service center problem (Q1680546) (← links)
• Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm (Q1701611) (← links)