Pages that link to "Item:Q876719"

The following pages link to Approximation algorithms for Hamming clustering problems (Q876719):

Displaying 7 items.

• A new class of weighted similarity indices using polytomous variables (Q263349) (← links)
• Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
• Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
• On the interpoint distances of Bernoulli vectors (Q2444401) (← links)
• The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)