Pages that link to "Item:Q263094"
From MaRDI portal
The following pages link to Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094):
Displaying 10 items.
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- The weighted sitting closer to friends than enemies problem in the line (Q2099388) (← links)
- Reconstruction of line-embeddings of graphons (Q2136610) (← links)
- Robinsonian matrices: recognition challenges (Q2403299) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- An Optimal Algorithm for Strict Circular Seriation (Q5018899) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
- A Simple and Optimal Algorithm for Strict Circular Seriation (Q5888295) (← links)
- Modules in Robinson Spaces (Q6187080) (← links)
