Pages that link to "Item:Q293209"

The following pages link to The \(p\)-neighbor \(k\)-center problem (Q293209):

Displaying 15 items.

• Fault tolerant \(K\)-center problems (Q1575549) (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
• \(k\)-center problems with minimum coverage (Q1770377) (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
• A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
• Asymmetry in \(k\)-center variants (Q2503348) (← links)
• Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem (Q2673563) (← links)
• Clustering with faulty centers (Q6092308) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)