𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Tractability and approximability of optimization problems

✍ Scribed by Chen J.


Year
2003
Tongue
English
Leaves
397
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Complexity and Approximation: Combinator
✍ G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. Sp πŸ“‚ Library πŸ“… 2003 πŸ› Springer, Berlin 🌐 German

This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically w

Complexity and Approximation: Combinator
✍ Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gam πŸ“‚ Library πŸ“… 1999 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>N COMPUTER applications we are used to live with approximation. VarΒ­ I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numerΒ­ ical analysis or in computational geometry from the fact that we cannot perform compu

Structure of Approximate Solutions of Op
✍ Alexander J. Zaslavski (auth.) πŸ“‚ Library πŸ“… 2013 πŸ› Springer International Publishing 🌐 English

<p>This title examines the structure of approximate solutions of optimal control problems considered on subintervals of a real line. Specifically at the properties of approximate solutions which are independent of the length of the interval. The results illustrated in this book look into the so-call