Polynomial-Time Aggregation of Integer Programming Problems

Authors:
Ravindran Kannan
Affiliations:
Mathematics Department, Massachusetts Institute of Technology, Cambridge, MA and University of California, Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
1983

The Complexity of the Extended GCD Problem

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)

Theoretical Computer Science
New Hardness Results for Diophantine Approximation

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

Operations Research Letters

Hi-index	0.01