Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...
Marcin Bienkowski, Leszek Gasieniec, Marek Klonows...
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...