We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
One of the upcoming challenges in embedded processing is to incorporate an increasing amount of adaptivity in order to respond to the multifarious constraints induced by today’s...
Lars Bauer, Muhammad Shafique, Stephanie Kreutz, J...