000			03375nam a22004815i 4500
001			u375336
003			SIRSI
005			20160812084319.0
007			cr nn 008mamaa
008			101029s2010 gw | s |||| 0|eng d
020			_a9783642165337 _9978-3-642-16533-7
040			_cMX-MeUAM
050		4	_aQA76.9.A43
082	0	4	_a005.1 _223
100	1		_aFomin, Fedor V. _eauthor.
245	1	0	_aExact Exponential Algorithms _h[recurso electrónico] / _cby Fedor V. Fomin, Dieter Kratsch.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXIV, 206 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTexts in Theoretical Computer Science. An EATCS Series, _x1862-4499
505	0		_aBranching -- 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			_aToday 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		0	_aComputer science.
650		0	_aComputer software.
650		0	_aCombinatorics.
650		0	_aMathematical optimization.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aOptimization.
650	2	4	_aCombinatorics.
700	1		_aKratsch, Dieter. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642165320
830		0	_aTexts in Theoretical Computer Science. An EATCS Series, _x1862-4499
856	4	0	_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-16533-7
596			_a19
942			_cLIBRO_ELEC
999			_c203216 _d203216