Efficient Approximation and Online Algorithms

Efficient Approximation and Online Algorithms

4.11 - 1251 ratings - Source

This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.The solution I„x to (GLP) on d is, also, a feasible solution to (GLP) on the HST metric d I„T, since only the metric over the ... Therefore, the rounding procedure proposed by Kleinberg and Tardos for (TLP) [58], can be used to get, this way, anbsp;...

Title:Efficient Approximation and Online Algorithms
Author: Evripidis Bampis, Klaus Jansen, Claire Kenyon
Publisher:Springer Science & Business Media - 2006-02-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