Sciweavers

WADS
2005
Springer
162views Algorithms» more  WADS 2005»
14 years 2 months ago
The Minimum-Area Spanning Tree Problem
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...
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
WADS
2005
Springer
133views Algorithms» more  WADS 2005»
14 years 2 months ago
Heap Building Bounds
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...
Zhentao Li, Bruce A. Reed
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 2 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
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...
André Berger, Ojas Parekh
WADS
2005
Springer
78views Algorithms» more  WADS 2005»
14 years 2 months ago
The On-line Asymmetric Traveling Salesman Problem
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
14 years 2 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
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 ...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
WADS
2005
Springer
96views Algorithms» more  WADS 2005»
14 years 2 months ago
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes
Giora Alexandron, Haim Kaplan, Micha Sharir
WADS
2005
Springer
69views Algorithms» more  WADS 2005»
14 years 2 months ago
Succinct Representation of Triangulations with a Boundary
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 2 months ago
Communication-Aware Processor Allocation for Supercomputers
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...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 2 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
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....
Minkyoung Cho, David M. Mount