Cover Image

Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics /

Show other versions (3)

There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity...

Full description

Bibliographic Details
Main Author: Hromkovič, Juraj
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
Edition:Second Edition.
Series:Texts in Theoretical Computer Science An EATCS Series.
Subjects:
Computer science.
Data transmission systems.
Computer Communication Networks.
Computer science > Mathematics.
Electronics.
Telecommunication.
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • Introduction
  • Elementary Fundamentals
  • Deterministic Approaches
  • Approximation Algorithms
  • Randomized Algorithms
  • Heuristics
  • A Guide to Solving Hard Problems
  • References
  • Index.