Minimum Cost Paths in Periodic Graphs
- 1 October 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (5) , 1051-1067
- https://doi.org/10.1137/s0097539792234378
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphsJournal of the ACM, 1993
- Recognizing properties of periodic graphsPublished by American Mathematical Society (AMS) ,1991
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- Some Problems on Dynamic/Periodic GraphsPublished by Elsevier ,1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- On the complexity of integer programmingJournal of the ACM, 1981
- Value of the Steinitz constantFunctional Analysis and Its Applications, 1980
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The Organization of Computations for Uniform Recurrence EquationsJournal of the ACM, 1967