Pages that link to "Item:Q500977"
From MaRDI portal
The following pages link to Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977):
Displaying 22 items.
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- A note on computing the center of uncertain data on the real line (Q1790197) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- The coverage problem by aligned disks (Q2695288) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← 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)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
- The Weighted Euclidean 1-Center Problem (Q3316925) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (Q3760268) (← 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)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- The Coverage Problem by Aligned Disks (Q6173214) (← links)
- Variants of Euclidean \(k\)-center clusterings (Q6591472) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
