Pages that link to "Item:Q1281390"

The following pages link to Approximation algorithms for min-sum \(p\)-clustering (Q1281390):

Displaying 9 items.

• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• Min sum clustering with penalties (Q976485) (← links)
• Approximating the maximum quadratic assignment problem (Q1607075) (← links)
• Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
• Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland (Q2359522) (← links)
• Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)