An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter::MPG.PuRe

Local TagsRelease HistoryDetailsSummary

An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter

Item is Released

Name of Tag