Pages that link to "Item:Q3035114"

The following pages link to Un nuevo resultado sobre la complejidad del problema delP-centro (Q3035114):

Displaying 13 items.

• The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
• New algorithms for \(k\)-center and extensions (Q849133) (← links)
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142) (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• A vertex-closing approach to the p-center problem (Q3474476) (← 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)
• (Q4875162) (← links)
• On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)