1429 search results - page 21 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
RECOMB
1997
Springer
13 years 11 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
IMS
2000
13 years 11 months ago
2000
Many architectural ideas that appear to be useful from a hardware standpoint fail to achieve wide acceptance due to lack of compiler support. In this paper we explore the design of...
IEEEPACT
2009
IEEE
14 years 2 months ago
2009
IEEE
—Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-...
22
Voted
ESA
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...