Work in the new millennium requires globally distributed organizational members to collaborate in groups and make decisions. In general, research has shown that groups that use fa...
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler
This paper presents the ADHOCFS file system for mobile users, which realizes transparent, adaptive file access according to the users’ specific situations (e.g., device in us...
Abstract. We show how the firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. On that basis we introduce closed monoidal str...