Pages that link to "Item:Q1278142"

The following pages link to Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142):

Displaying 20 items.

• The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
• Covering moving points with anchored disks (Q421753) (← links)
• Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
• A relaxation-based algorithm for solving the conditional \(p\)-center problem (Q974996) (← links)
• Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff (Q2514827) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• Un nuevo resultado sobre la complejidad del problema delP-centro (Q3035114) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p (Q3603555) (← links)
• On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (Q3760268) (← links)
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem (Q4216137) (← links)
• Minimum-diameter covering problems (Q4520238) (← links)
• (Q4875162) (← links)
• A Polynomial Time Approximation Scheme for the Closest Shared Center Problem (Q4925254) (← links)
• (Q5005143) (← links)
• (Q5136270) (← links)