Abstract
This paper considers the “Frobenius problem” : Given n natural numbers a 1, a 2, ... a n such that the greatest common divisor of a 1,a 2, ... a n equal to 1, find the largest natural number that is not expressible as a nonnegative integer combination of them. This problem is NP-hard; but for the cases n=2, 3 polynomial time algorithms are known to solve it. Here a polynomial time algorithm is given for every fixed n. This is done by first proving an exact relation between the Frobenius problem and a geometric concept called the “covering radius”. Then a polynomial time algorithm is developed for finding the covering radius of any polytope in a fixed number of dimensions. The last algorithm relies on a structural theorem proved here that describes for any polytope K, the set K + Z n = {x : x ∈ R n; x = y + z; y ∈ K; z ∈ Z n∼. The proof of the structural theorem relies on some recent developments in the Geometry of Numbers. In particular, it draws on the notion of “width” and covering radius introduced in Kannan and Lovàsz [7], a theorem of Hastad [5] bounding the width of lattice-point-free convex bodies and the techniques of Kannan, Lovász and Scarf [8] to study the shapes of a polyhedron obtained by translating each facet parallel to itself. The concepts involved are defined from first principles.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported by NSF-Grant CCR 8805199.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D.E. Bell, A theorem concerning the integer lattice, Studies in Applied Mathematics, 56, (1977) pp187–188
A. Brauer and J.E. Shockley, On a problem of Frobenius, Journal für reine und angewnadte Mathematik, 211 (1962) pp 215–220
P.Erdös and R.Graham, On a linear diophantine problem of Frobenius, Acta Arithmetica, 21 (1972).
M.Grötschel, L.Lovász and A.Schrijver, Geometric algorithms and combinatorial optimization, Springer Verlag (1988)
J.Hastad, Private Communication.
J. Incerpi and R.Sedgwick, Improved upper bounds on ShellSort, 24 th FOCS, (1983).
R.Kannan and L.Lovász, Covering minima and lattice point free convex bodies, in Lecture Notes in Computer Science 241, ed. K.V.Nori, Springer-Verlag (1986) pp 193–213. Final version in Annals of Mathematics, November (1988).
R.Kannan, L.Lovász and H.E.Scarf, The shapes of polyhedra, Cowles Foundation Discussion paper No. 883, September (1988). To appear in Mathematics of Operations Research.
J.Lagarias, H.W.Lenstra and C.P.Schnorr, Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, To appear in Combinatorica (1989)
H.W. Lenstra, Integer programming with a fixed number of variables, Mathematics of Operations research, Volume 8, Number 4 Nov (1983) pp 538–548
L.Lovász, Geometry of Numbers and Integer Programming, Proceedings of the 13 th International Symposium on Mathematical Programming, (1988)
O.J.Rödseth, On a linear diophantine problem of Frobenius, Journal für Mathematik, Band 301, (1977).
H.E. Scarf, An observation on the structure of production sets with indivisibilities, Proceedings of the National Academy of Sciences, USA, 74, pp 3637–3641 (1977).
H.E.Scarf and D.Shallcross, Private Communication.
R.Sedgwick, A new upper bound for ShellSort, Journal of Algorithms, 7 (1986).
E.S.Selmer, On the linear diophantine problem of Frobenius, Journal für Mathematik, Band 293/294 (1977).
E.S.Selmer and O.Beyer, On the linear diophantine problem of Frobenius in three variables Journal für Mathematik, Band 301, (1977).
A.Schrijver,, Theory of Linear and Integer Programming, Wiley (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kannan, R. (1989). The frobenius problem. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_47
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive