Pages that link to "Item:Q924878"
From MaRDI portal
The following pages link to An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878):
Displaying 10 items.
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- A minmax regret median problem on a tree under uncertain locations of the demand points (Q2450737) (← links)
- Lexicographic<i>α</i>-robustness: an application to the 1-median problem (Q3561752) (← links)
