Seriation in the presence of errors: a factor 16 approximation algorithm for l_ -fitting Robinson structures to distances
From MaRDI portal
Publication:633846
Recommendations
- An approximation algorithm for \(\ell_{\infty}\) fitting Robinson structures to distances
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- An optimal algorithm to recognize Robinsonian dissimilarities
- An optimization parameter for seriation of noisy data
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
Cites work
- \(l_\infty\)-approximation via subdominants.
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- A Geometric Approach to Betweenness
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A robust model for finding optimal evolutionary tree
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Fitting points on the real line and its application to RH mapping
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 3843553 (Why is no real title available?)
- scientific article; zbMATH DE number 4213811 (Why is no real title available?)
- scientific article; zbMATH DE number 4098484 (Why is no real title available?)
- scientific article; zbMATH DE number 3521374 (Why is no real title available?)
- scientific article; zbMATH DE number 953009 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 802809 (Why is no real title available?)
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Low-distortion embeddings of general metrics into the line
- Matrix visualization and information mining
- Monotone mapping of similarities into a general metric space
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Multidimensional scaling. I: Theory and method
- Nonmetric multidimensional scaling. A numerical method
- NP-hard approximation problems in overlapping clustering.
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- On the recognition of permuted bottleneck Monge matrices
- Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics
- Recognition of Robinsonian dissimilarities
- Relationship-based clustering and visualization for high-dimensional data mining
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The NP-completeness column: An ongoing guide
- The Structural Representation of Proximity Matrices with MATLAB
Cited in
(25)- Flinders Petrie, the travelling salesman problem, and the beginning of mathematical modeling in archaeology
- Seriation using tree-penalized path length
- The weighted sitting closer to friends than enemies problem in the line
- Reconstruction of line-embeddings of graphons
- Cut norm discontinuity of triangular truncation of graphons
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- An optimal algorithm to recognize Robinsonian dissimilarities
- Measuring indifference: unit interval vertex deletion
- Convex relaxations for permutation problems
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
- Splitting metrics by \(T_0\)-quasi-metrics
- An Optimal Algorithm for Strict Circular Seriation
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- An optimization parameter for seriation of noisy data
- An approximation algorithm for \(\ell_{\infty}\) fitting Robinson structures to distances
- A Simple and Optimal Algorithm for Strict Circular Seriation
- Graph sequences sampled from Robinson graphons
- Modules in Robinson Spaces
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Robust recovery of Robinson property in L^p-graphons: a cut-norm approach
- Two simple but efficient algorithms to recognize Robinson dissimilarities
- Continuation methods for approximate large scale object sequencing
- \texttt{PQser:} a Matlab package for spectral seriation
- Seriation of Tœplitz and latent position matrices: optimal rates and computational trade-offs
- Tree-Robinson dissimilarities
This page was built for publication: Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633846)
