Pages that link to "Item:Q486974"
From MaRDI portal
The following pages link to A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974):
Displaying 3 items.
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
