Abstract
AbstractGiven a finite set of N nodes and the time required for traveling among nodes, in the traveling repairman problem, we seek a route that minimizes the sums of the delays for reaching each node. In this note, we present a linear algorithm for solving the traveling repairman problem when the underlying graph is a path, improving the Θ(N2) time and space complexity of the previously best algorithm for this problem. We also provide a linear algorithm for solving the walk problem with deadlines (WPD) on paths. © 2002 Wiley Periodicals, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
