Data Structures for Mobile Data
Akinetic data structure(KDS) maintains an attribute of interest in a system of geometric objects undergoing continuous motion. In this paper we develop a concentual framework for kinetic data structures, we propose a number of criteria for the quality ...
Optimal Coarsening of Unstructured Meshes
A bounded aspect-ratio coarsening sequence of an unstructured meshM0is a sequence of meshesM1, ,Mksuch that: is a bounded aspect-ratio mesh, and is an approximation ofthat has fewer elements,where a mesh is called a bounded aspect-ratio mesh if all its ...
The Influence of Caches on the Performance of Sorting
We investigate the effect that caches have on the performance of sorting algorithms both experimentally and analytically. To address the performance problems that high cache miss penalties introduce we restructure mergesort, quicksort, and heapsort in ...
Shortest-Path Routing in Arbitrary Networks
We introduce an on-line protocol which routes any set ofNpackets along shortest paths with congestionCand dilationDthrough an arbitrary network inO(C+D+logN) steps, with high probability. This time bound is optimal up to the additive logN, and it has ...
Sylow Subgroups in Parallel
Sylow subgroups are fundamental in the design of asymptotically efficient group-theoretic algorithms, just as they have been in the study of the structure of finite groups. We present efficient parallel (NC) algorithms for finding and conjugating Sylow ...
A Greedy On-Line Algorithm for thek-Track Assignment Problem
Given a collection I ofnjobs that are represented by intervals, we seek a maximal feasible assignment of the jobs tokmachines such that not more thanc(M) intervals overlap pairwise on any machineMand that a job is only assigned to a machine if it fits ...
Approximating Node-Deletion Problems for Matroidal Properties
The paper is concerned with the polynomial time approximability of node-deletion problems for hereditary properties. It is observed that, when such a property derives a matroid on any graph, the problem can be formulated as a matroid set cover ...
Greedy Strikes Back
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There are associated costs for locating the facilities, as well ...
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle isNP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is ...
