Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...
In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This typ...
Enrico Gerding, Sebastian Stein, Kate Larson, Alex...