Complexity and Approximation

Complexity and Approximation

4.11 - 1251 ratings - Source

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.... set of pairs T = {(s1, ti), ..., (sk, ty)} with si, ti a‚n V. SOLUTION: A collection of edge disjoint paths in G connecting some of ... 1995], or more generally, if G is a nearly -Eulerian uniformly high-diameter planar graph [Kleinberg and Tardos, 1995].

Title:Complexity and Approximation
Author: Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi
Publisher:Springer Science & Business Media - 2012-12-06

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA