Pages that link to "Item:Q1575549"

The following pages link to Fault tolerant \(K\)-center problems (Q1575549):

Displaying 30 items.

• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
• Matroid and knapsack center problems (Q300451) (← links)
• The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
• Fault tolerant \(K\)-center problems (Q1575549) (← 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)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Asymmetry in \(k\)-center variants (Q2503348) (← links)
• One-way and round-trip center location problems (Q2568335) (← links)
• Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
• Hotelling games in fault-prone settings (Q2672575) (← links)
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem (Q2673563) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• (Q5002778) (← links)
• (Q5136270) (← links)
• (Q5874506) (← links)
• Mixed fault tolerance in server assignment: combining reinforcement and backup (Q5918902) (← links)
• Approximation algorithms for the individually fair \(k\)-center with outliers (Q6064038) (← links)
• Clustering with faulty centers (Q6092308) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)