In network problems, the latency is associated with the metric to evaluate the length of the path from a root vertex to each vertex in the network. In this work we are dealing with two applications or variations of the minimum latency problem known as the repairman problem and the delivery...
The minimum latency problem is NP-hard for weighted trees - Sitters - 2006 () Citation Context ... space which minimizes the sum of the latencies to the points, where the latency of a point is its distance along the tour. This problem is NP-complete even when the metric space is ...
The Minimum Latency Problem No Abstract Available. By: A. Blum, P. Chalasani (CMU), D. Coppersmith, B. Pulleyblank, P. Raghavan and M. Sudan Published in: RC19418 in 1994 LIMITED DISTRIBUTION NOTICE: This Research Report is available. This report has been submitted for publication out...
The Minimum Latency Problem Is NP-Hard for Weighted Trees In the minimum latency problem (MLP) we are given n points v1,..., vn and a distance d(vi,vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the R Sitters 被引量...
Also well-known is the Deliveryman Problem in which we have to find a path visiting all vertices so as to minimize the average completion time of the vertices, which is also known as the Traveling Repairman Problem (TRP) or the Minimum Latency Problem. The CDP fits nicely in this list ...
The KTR problem with k=1 is known as the minimum latency problem (MLP) in the literature. The first constant factor approximation for MLP was given by Blum et al. [2]. Goemans and Kleinberg [8] improved the ratio for MLP to 3.59α, where α is the best achievable approximation ratio...
The minimum latency differences are not very large, and could perhaps be explained by hardware differences -- the Xeon E5 v2 processors have a single ring with 10 stops, while the 14-core Xeon E5 v3 processor has two rings (one with 8 stops and one with 10 stops) that are ...
Stressed latency uses the unique applications of the ONT, such as dynamic skew inject and frequency variation together with the precision latency capabilities, to allow the true latency performance to be characterized. It also gives deep insight into problem areas to allow rapid diagnosis and correcti...
setting these options for shorter polling intervals might significantly improve the accuracy of the system clock. The optimal polling interval depends mainly on two factors, stability of the network latency and stability of the system clock (which mainly depends on the temperature sensitivity of the ...
The problem of priority inversion has been addressed for mutual-exclusion locks for the SunOS kernel by implementing a basic priority inheritance policy. The policy states that a lower-priority process inherits the priority of a higher-priority process when the lower-priority process blocks the execu...