It is shown that the problem of 1 + en-rounding of A can be solved in Om3.5 lnme-1 operations to a relative accuracy of e in the volume, and that bounds hold for the real number model of computation.Expand

The coordination complexity of approximate price-directive decomposition PDD for the general block-angular convex resource sharing problem in K blocks and M nonnegative block-separable coupling constraints is studied and the fastest currently-known deterministic approximation algorithm for minimum-cost multicommodity flows is obtained.Expand

A parallel randomized algorithm which computes a pair of @e-optimal strategies for a given (m,n)-matrix game A achieves an almost quadratic expected speedup relative to any deterministic method.Expand

We present a Lagrangian decomposition algorithm which uses logarithmic potential reduction to compute an $\varepsilon$-approximate solution of the general max-min resource sharing problem with M… Expand

It is shown that for some classes of polynomial-time computable monotone Boolean functions it is NP-hard to test either of the conditions D′=D or C′=C, which provides evidence that for each of these classes neither conjunctive nor disjunctive irredundant normal forms can be generated in total (or incremental) quasi-polynomial time.Expand

Abstract AN ACCURATE quadratic programming algorithm is constructed, in which the amount of work is bounded by a polynomial of the length of the recording of the problem in the binary number system.

This paper presents block-coordinate descent algorithms for the approximate solution of large structured convex programming problems and shows that feasibility as well as min-mix resource-sharing problems for such constraints can be solved to a relative accuracy.Expand

It is shown that the short paths node-wise interdiction problem can be efficiently solved by an extension of Dijkstra’s algorithm and the same inapproximability bounds hold for undirected graphs and/or node elimination.Expand