WADS
2005
Springer
14 years 5 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
WADS
2005
Springer
14 years 5 months ago
2005
Springer
WADS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
WADS
2005
Springer
14 years 5 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
WADS
2005
Springer
14 years 5 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
WABI
2005
Springer
14 years 5 months ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
WABI
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...