ESA
2008
Springer
13 years 11 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
ESA
2008
Springer
13 years 11 months ago
2008
Springer
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
ESA
2008
Springer
13 years 11 months ago
2008
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...