Computing similarity distances between rankings

DOI10.1016/j.dam.2017.07.038zbMath1372.05003arXiv1307.4339OpenAlexW2964136514MaRDI QIDQ2410235

Lili Su, Farzad Farnoud (Hassanzadeh), Gregory J. Puleo, Olgica Milenković

Publication date: 17 October 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.4339

zbMATH Keywords

permutationssimilarity distancetransposition distance

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Query strategies for priced information
• Interchange rearrangement: the element-cost model
• Query strategies for priced information (extended abstract)
• Sorting by Transpositions
• Sorting of Permutations by Cost-Constrained Transpositions
• Sorting and Selection with Random Costs
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Computing similarity distances between rankings