Polynomial time algorithms for some minimum latency problems

@article{Wu2000PolynomialTA,
  title={Polynomial time algorithms for some minimum latency problems},
  author={Bang Ye Wu},
  journal={Inf. Process. Lett.},
  year={2000},
  volume={75},
  pages={225-229}
}
Given a graph and an origin, the minimum weighted latency problem looks for a tour starting at the origin and visiting all the vertices so as to minimize the sum of the latencies of the vertices multiplied by their weights, in which the latency of a vertex is the distance from the origin to the first visit of the vertex on the tour. In this paper, we show that the minimum weighted latency problem on some graphs can be solved in polynomial time by dynamic programming. The dynamic programming… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem

  • 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future
  • 2012
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Minimum Back-Walk-Free Latency Problem with Multiple Servers

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Sequence-dependent scheduling with order deliveries

  • Applied Mathematics and Computation
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND