Pages that link to "Item:Q3525757"
From MaRDI portal
The following pages link to An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees (Q3525757):
Displaying 9 items.
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- The multi-service center problem (Q1680546) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)