175
Voted
WADS
15 years 11 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 ...
147
click to vote
WADS
15 years 11 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...
173
click to vote
WADS
15 years 11 months ago
2005 Springer 
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
177
click to vote
WADS
15 years 11 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...
135
click to vote
WADS
15 years 11 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...
|
Algorithms