WADS
2005
Springer
14 years 5 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
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....