logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Algorithmics For Hard Problems Introduction To Combinatorial Optimization Randomization Approximation And Heuristics 1st Juraj Hromkovi

  • SKU: BELL-4199160
Algorithmics For Hard Problems Introduction To Combinatorial Optimization Randomization Approximation And Heuristics 1st Juraj Hromkovi
$ 31.00 $ 45.00 (-31%)

0.0

0 reviews

Algorithmics For Hard Problems Introduction To Combinatorial Optimization Randomization Approximation And Heuristics 1st Juraj Hromkovi instant download after payment.

Publisher: Springer
File Extension: PDF
File size: 11.72 MB
Pages: 500
Author: Juraj Hromkovič
ISBN: 9783662046166, 9783662046180, 3662046164, 3662046180
Language: English
Year: 2001
Edition: 1st

Product desciption

Algorithmics For Hard Problems Introduction To Combinatorial Optimization Randomization Approximation And Heuristics 1st Juraj Hromkovi by Juraj Hromkovič 9783662046166, 9783662046180, 3662046164, 3662046180 instant download after payment.

This textbook provides a "cheap ticket" to the design of algorithms for hard
computing problems, Le., for problems for which no low-degree polynomial-time
algorithms1 are known. It focuses on a systematic presentation of the fundamental
concepts and algorithm design techniques. The
presentation of these concepts and techniques starts with some fundamental
informal ideas that are later consecutively specified in detail. The algorithms
used to illustrate the application of these methods are chosen with respect to
their simplicity and transparency rather than with respect to their quality (complexity
and reliability).

Related Products