Pages that link to "Item:Q3960131"
From MaRDI portal
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 6 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)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)