Fitting points on the real line and its application to RH mapping
From MaRDI portal
Publication:4820904
DOI10.1016/S0196-6774(03)00083-XzbMATH Open1064.68069DBLPjournals/jal/HastadIL03WikidataQ56958958 ScholiaQ56958958MaRDI QIDQ4820904FDOQ4820904
Authors: Lars Ivansson, Jens Lagergren, Johan Hastad
Publication date: 1 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (5)
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Algorithms for RH Mapping: New Ideas and Improved Analysis
- Randomized vs. deterministic distance query strategies for point location on the line
- Linear layouts of weakly triangulated graphs
This page was built for publication: Fitting points on the real line and its application to RH mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820904)