Sciweavers

2489 search results - page 14 / 498
» On the Subgroup Distance Problem
Sort
View
OL
2010
185views more  OL 2010»
13 years 5 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
TAMC
2009
Springer
14 years 1 months ago
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...
Binhai Zhu
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 1 months ago
On the number of solutions of the discretizable molecular distance geometry problem
The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-...
Leo Liberti, Benoît Masson, Jon Lee, Carlile...
JCO
2008
76views more  JCO 2008»
13 years 7 months ago
On the inapproximability of the exemplar conserved interval distance problem of genomes
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 2 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng