Pages that link to "Item:Q1006061"
From MaRDI portal
The following pages link to Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061):
Displaying 5 items.
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Computing the 2‐median on tree networks in O(n lg n) time (Q4894868) (← links)
- Efficient computation of 2-medians in a tree network with positive/negative weights (Q5899357) (← links)
- Efficient algorithms for finding <scp>2‐medians</scp> of a tree (Q6087120) (← links)