Texts in Theoretical Computer Science. an Eatcs: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Hardcover)
Texts in Theoretical Computer Science. an Eatcs: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Hardcover)
Hero image 0 of Texts in Theoretical Computer Science. an Eatcs: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Hardcover), 0 of 1

Texts in Theoretical Computer Science. an Eatcs: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Hardcover)

(No ratings yet)

Key item features

Texts in Theoretical Computer Science. an Eatcs: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Hardcover)

Specs

Publication date, October, 2002Author, Juraj HromkovičBook format, HardcoverGenre, EducationPages, 538Binding type, Hardcover

About this item

Product details

Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami- cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in- cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com- municated to students and practitioners.
Texts in Theoretical Computer Science. an Eatcs: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Hardcover)
info:
We aim to show you accurate product information. Manufacturers, suppliers and others provide what you see here, and we have not verified it.  

Specifications

Publication date

October, 2002

Author

Juraj Hromkovič

Book format

Hardcover

Genre

Education

Warranty

Warranty information

Please be aware that the warranty terms on items offered for sale by third party Marketplace sellers may differ from those displayed in this section (if any). To confirm warranty terms on an item offered for sale by a third party Marketplace seller, please use the 'Contact seller' feature on the third party Marketplace seller's information page and request the item's warranty terms prior to purchase.

Customer ratings & reviews

0 out of 5 stars
0 ratings|0 reviews
This item does not have any reviews yet
Current price is $82.75
Price when purchased online
  • Free shipping
  • Free 90-day returns

How do you want your item?

Try 30 days for just $1! Choose a plan at checkout.
How do you want your item?
Ships to
Arrives by Mon, Nov 30
Sold and shipped by Walmart.com
Free 90-day returns
This item is gift eligible

More seller options (3)

Starting from $82.75
walmart plus

Try 30 days of Walmart+ for just $1!

T&C apply.