Fast 2-Variable Integer Programming

Authors:
Friedrich Eisenbrand;Günter Rote
Affiliations:
-;-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 11
Cited 2

Theory of linear and integer programming

Theory of linear and integer programming
Minkowski's convex body theorem and integer programming

Mathematics of Operations Research
Fast reduction and composition of binary quadratic forms

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Las Vegas algorithms for linear and integer programming when the dimension is small

Journal of the ACM (JACM)
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

Journal of the ACM (JACM)
A Polynomial Algorithm for the Two-Variable Integer Programming Problem

Journal of the ACM (JACM)
A Fast Algorithm for the Two-Variable Integer Programming Problem

Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Short vectors of planar lattices via continued fractions

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Fast unimodular reduction: planar integer lattices

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Computing efficiently the lattice width in any dimension

Theoretical Computer Science
The exact lattice width of planar sets and minimal arithmetical thickness

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a 2-variable integer program defined by m constraints involving coefficients with at most s bits can be solved with O(m+s logm) arithmetic operations or with O(m+logmlog s)M(s) bit operations, where M(s) is the time needed for s-bit integer multiplication.