11 search results - page 1 / 3 » On the Hamming distance in combinatorial optimization proble... |
OL
2010
13 years 2 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
SODA
2010
ACM
14 years 1 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
TCBB
2008
13 years 4 months ago
2008
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
CP
2009
Springer
14 years 5 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...