Pages that link to "Item:Q6087120"
From MaRDI portal
The following pages link to Efficient algorithms for finding <scp>2‐medians</scp> of a tree (Q6087120):
Displaying 8 items.
- 2-medians in trees with pos/neg weights (Q1582068) (← links)
- Algorithms for path medi-centers of a tree (Q1819243) (← links)
- The median procedure for n-trees (Q1822174) (← links)
- The balanced 2-median and 2-maxian problems on a tree (Q2687920) (← links)
- (Q4281639) (← 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)
- On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)