MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02810nmm a22003015i 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20230705150646.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
101029s2010 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642165337 |
| -- |
978-3-642-16533-7 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.1 |
| Edition number |
23 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Fomin, Fedor V. |
| 9 (RLIN) |
20947 |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Exact Exponential Algorithms |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc. |
by Fedor V. Fomin, Dieter Kratsch. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
1st ed. 2010. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Berlin, Heidelberg : |
| Name of publisher, distributor, etc. |
Springer Berlin Heidelberg : |
| -- |
Imprint: Springer, |
| Date of publication, distribution, etc. |
2010. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XIV, 206 p. 38 illus. |
| Other physical details |
online resource. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Branching -- Dynamic Programming -- Inclusion-Exclusion -- Treewidth -- Measure & Conquer -- Subset Convolution -- Local Search and SAT -- Split and List -- Time Versus Space -- Miscellaneous -- Conclusions, Open Problems and Further Directions. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms. The history of exact exponential algorithms for NP-hard problems dates back to the 1960s. The two classical examples are Bellman, Held and Karp's dynamic programming algorithm for the traveling salesman problem and Ryser's inclusion-exclusion formula for the permanent of a matrix. The design and analysis of exact algorithms leads to a better understanding of hard problems and initiates interesting new combinatorial and algorithmic challenges. The last decade has witnessed a rapid development of the area, with many new algorithmic techniques discovered. This has transformed exact algorithms into a very active research field. This book provides an introduction to the area and explains the most common algorithmic techniques, and the text is supported throughout with exercises and detailed notes for further reading. The book is intended for advanced students and researchers in computer science, operations research, optimization and combinatorics. . |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Discrete mathematics. |
| 9 (RLIN) |
20948 |
|
|---|
| Topical term or geographic name entry element |
Mathematical optimization. |
| 9 (RLIN) |
20949 |
|
|---|
| Topical term or geographic name entry element |
Computer programming. |
| 9 (RLIN) |
20950 |
|
|---|
| Topical term or geographic name entry element |
Algorithms. |
| 9 (RLIN) |
20951 |
|
|---|
| Topical term or geographic name entry element |
Discrete Mathematics. |
| 9 (RLIN) |
20952 |
|
|---|
| Topical term or geographic name entry element |
Optimization. |
| 9 (RLIN) |
20953 |
|
|---|
| Topical term or geographic name entry element |
Programming Techniques. |
| 9 (RLIN) |
20954 |
|
|---|
| Topical term or geographic name entry element |
Algorithms. |
| 9 (RLIN) |
20951 |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Kratsch, Dieter. |
| Relator term |
author. |
| Relationship |
aut |
| -- |
http://id.loc.gov/vocabulary/relators/aut |
| 9 (RLIN) |
20955 |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="https://doi.org/10.1007/978-3-642-16533-7">https://doi.org/10.1007/978-3-642-16533-7</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
e-Book |
