Semi-preemptive routing on a linear and circular track

Discrete Optimization - Tập 6 - Trang 223-230 - 2009
Dirk Räbiger1, Rainer Schrader1
1Zentrum für Angewandte Informatik, Universität zu Köln, Weyertal 80, 50931 Köln, Germany

Tài liệu tham khảo

Atallah, 1988, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM Journal on Computing, 17, 849, 10.1137/0217053 Guan, 1998, Routing a vehicle of capacity greater than one, Discrete Applied Mathematics, 81, 41, 10.1016/S0166-218X(97)00074-7 Frederickson, 1992, Preemptive ensemble motion planning on a tree, SIAM Journal on Computing, 21, 1130, 10.1137/0221066 Frederickson, 1993, Nonpreemptive ensemble motion planning on a tree, Journal of Algorithms, 15, 29, 10.1006/jagm.1993.1029 Krumke, 2008, Semi-preemptive routing on trees, Discrete Applied Mathematics, 156, 3298, 10.1016/j.dam.2008.05.016 Gabow, 1984, Efficient algorithms for a family of matroid intersection problems, Journal of Algorithms, 5, 80, 10.1016/0196-6774(84)90042-7 Gabow, 1986, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatoria, 6, 109, 10.1007/BF02579168