Pages that link to "Item:Q3603555"
From MaRDI portal
The following pages link to Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p (Q3603555):
Displaying 14 items.
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- An algorithm and a core set result for the weighted Euclidean one-center problem (Q2899026) (← links)
- Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Fighting terrorism: how to position rapid response teams? (Q6583695) (← links)
