๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Structure of Polynomial-Time Approximation

โœ Scribed by Erik Jan van Leeuwen; Jan van Leeuwen

Publisher
Springer
Year
2011
Tongue
English
Weight
969 KB
Volume
50
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the efficiency of polynomial time app
On the efficiency of polynomial time approximation schemes
โœ Marco Cesati; Luca Trevisan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 630 KB

A polynomial time approximation scheme (PTAS) for an optimization problem A is an algorithm that given in input an instance of A and E > 0 find;,; (1 + E)-approximate solution in time that is polynomial for each fixed E. Typical running times are no(+) or 2"' n. While algorithms of the former kind t

Polynomial-time approximation of largest
Polynomial-time approximation of largest simplices in V-polytopes
โœ Asa Packer ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 324 KB

This paper considers the problem of computing the squared volume of a largest j-dimensional simplex in an arbitrary d-dimensional polytope P given by its vertices (a "V -polytope"), for arbitrary integers j and d with 1 6 j 6 d. The problem was shown by Gritzmann, Klee and Larman to be NP-hard. This