Khachiyan Leonid G.

Leonid G. Khachiyan

Information about the author Leonid G. Khachiyan will soon be added to the site.
Found 5 papers in total
Rounding of polytopes in the real number model of computation
Rounding of polytopes in the real number model of computation
1996
Let 𝒜 be a set of m points in ℝ n . We show that the problem of (1 +...
Coordination complexity of parallel price-directive decomposition
Coordination complexity of parallel price-directive decomposition
1996
The general block-angular convex resource sharing problem in K blocks and M...
Approximate minimum-cost multicommodity flows in Õ (ϵ–2KNM) time
Approximate minimum-cost multicommodity flows in Õ (ϵ–2KNM) time
1996
We show that an ϵ-approximate solution of the cost-constrained K -commodity flow...
A sublinear-time randomized approximation algorithm for matrix games
A sublinear-time randomized approximation algorithm for matrix games
1995
This paper presents a parallel randomized algorithm which computes a pair of •-...
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
1993
The authors give a new polynomial bound on the complexity of approximating the maximal...
Papers per page: