A Note on the Complexity of a Simple Transportation Problem
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (1), 57-61
- https://doi.org/10.1137/0222005
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Nonpreemptive Ensemble Motion Planning on a TreeJournal of Algorithms, 1993
- Preemptive Ensemble Motion Planning on a TreeSIAM Journal on Computing, 1992
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm TravelSIAM Journal on Computing, 1988
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978