A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
P-Complete Approximation Problems
Journal of the ACM (JACM)
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation
Mathematical Programming: Series A and B
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
SIAM Journal on Computing
Strongly polynomial-time approximation for a class of bicriteria problems
Operations Research Letters
Theoretical Computer Science
Hi-index | 0.00 |
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine at a plant, where job J"i is associated with its processing time and a customer i located at location i to which the job is to be delivered. In addition, there is a single uncapacitated delivery vehicle available. All jobs (vehicle) are available for processing (delivery) at time 0. Our aim is to determine the sequence in which the jobs should be processed in the plant, the departure times of the vehicle from the plant, and the routing of the vehicle, so as to minimize the total latency (job delivery time). We present a 6e~16.309691-approximation algorithm for the problem.