Login / Signup
Partial inverse min-max spanning tree problem under the weighted bottleneck hamming distance.
Qingzhen Dong
Xianyue Li
Yu Yang
Published in:
J. Comb. Optim. (2023)
Keyphrases
</>
min max
hamming distance
pattern matching
max min
binary strings
distance measure
binary codes
hash functions
spanning tree
hamming space
binary representation
edit distance
interval data
machine learning
weighted graph
locality sensitive hashing
matching algorithm
recognition rate
high dimensional