Pages that link to "Item:Q3960131"

The following pages link to An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree (Q3960131):

Displayed 5 items.

• The discrete p-dispersion problem (Q915643) ‎ (← links)
• On search over rationals (Q1170866) ‎ (← links)
• Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) ‎ (← links)
• Continuous bottleneck tree partitioning problems (Q1827846) ‎ (← links)
• A finite algorithm for the continuousp-center location problem on a graph (Q3724065) ‎ (← links)