Rank Correlation Coefficient Correction by Removing Worst Cases

DOI10.1007/978-3-642-14055-6_37zbMath1209.68617OpenAlexW1525496974MaRDI QIDQ3164019

Frank Klawonn, Martin Krone

Publication date: 27 October 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14055-6_37

zbMATH Keywords

greedy algorithmgraph algorithmsrank correlation coefficient

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• A unified local ratio approximation of node-deletion problems
• Node-and edge-deletion NP-complete problems
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: Rank Correlation Coefficient Correction by Removing Worst Cases