Pages that link to "Item:Q4575742"
From MaRDI portal
The following pages link to Stochastic <i>k</i>-Center and <i>j</i>-Flat-Center Problems (Q4575742):
Displaying 14 items.
- On the separability of stochastic geometric objects, with applications (Q1615884) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- (Q5214247) (← links)
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Clustering with faulty centers (Q6092308) (← links)
- The two-center problem of uncertain points on trees (Q6606211) (← links)