SWAT
13 years 10 months ago
2004 Springer 
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
SWAT
13 years 10 months ago
2004 Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
SWAT
13 years 10 months ago
2004 Springer 
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
SWAT
13 years 10 months ago
2004 Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
SWAT
13 years 10 months ago
2004 Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
|
Algorithms