scientific article; zbMATH DE number 18540

MaRDI QIDQ3975941zbMATH OpenFDO

Authors R. Kannan

Publication date 26 June 1992

zbMATH Keywords

covering radiuslattice- point-free convex bodiespolyhedronpolynomial time algorithmpolytopewidth

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Lattices and convex bodies (number-theoretic aspects) (11H06) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• Frobenius' problem
• scientific article; zbMATH DE number 554876
• On the Frobenius problem
• scientific article; zbMATH DE number 4214113
• The Frobenius Problem and Its Generalizations
• scientific article; zbMATH DE number 3176160
• On a problem of Frobenius.
• scientific article; zbMATH DE number 3983264
• scientific article; zbMATH DE number 1320681
• scientific article; zbMATH DE number 2229032

Cited in

(18)

• The diophantine problem of Frobenius: A close bound
• Complexity of the Frobenius problem
• Integer points in knapsack polytopes and s-covering radius
• The parametric Frobenius problem
• Faster algorithms for Frobenius numbers
• scientific article; zbMATH DE number 6381750 (Why is no real title available?)
• Parametric polyhedra with at least k lattice points: their semigroup structure and the k-Frobenius problem
• Feasibility of integer knapsacks
• The Frobenius Problem and Maximal Lattice Free Bodies
• scientific article; zbMATH DE number 4218300 (Why is no real title available?)
• Frobenius numbers by lattice point enumeration
• The Frobenius Problem and Its Generalizations
• The Independent Even Factor Problem
• scientific article; zbMATH DE number 554876 (Why is no real title available?)
• Computing and Combinatorics
• The Ehrenfeucht-Silberger problem
• Frobenius problem and the covering radius of a lattice
• The inverse Fermat-Weber problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975941)