This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient… Expand

A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error.Expand

All three variants of the classical problem of optimal policy computation in Markov decision processes, finite horizon, infinite horizon discounted, and infinite horizon average cost are shown to be complete for P, and therefore most likely cannot be solved by highly parallel algorithms.Expand

Computational complexity is the realm of mathematical models and techniques for establishing impossibility proofs for proving formally that there can be no algorithm for the given problem which runs faster than the current one.Expand

It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$, if the planar problem is NP- hard, however, if £k$ is not fixed.Expand

An algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface and generalizes to the case of multiple source points to build the Voronoi diagram on the surface.Expand

These concepts and techniques are applied to formulate and solve approximately a cost-time-quality trade-off for optimizing access to the World-Wide Web, in a model first studied by Etzioni et al. (1996).Expand

Several efficiently recognizable subclasses of the class of senahzable histories are introduced and it is shown how these results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems.Expand