Author:
Bar-Yehuda Reuven,Even Guy,Shahar Shimon
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Lecture Notes in Computer Science;J. Augustine,2002
2. de Berg, M., van Kreveld, M., Overmars, M., Schwartzkopf, O.: Computational Geometry – Algorithms and Applications. Springer, Heidelberg (2000)
3. Erdös, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, 463–470 (1935)
4. Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Math. 11, 29–35 (1975)
5. Karuno, Y., Nagamochi, H., Ibaraki, T.: A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. Technical Report 98007 (1998)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximation Algorithms for the Multi-Vehicle Scheduling Problem;Algorithms and Computation;2010
2. Minimum Vehicle Routing with a Common Deadline;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2006
3. Maximum Coverage Problem with Group Budget Constraints and Applications;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2004