机读格式显示(MARC)

• 000 01546nam a2200253 a 4500

• 001 0000838487

• 005 20251107143600.0

• 008 131028s2014 flua b 001 0 eng

• 020 __ |a 9781439825648

• 040 __ |a NPU |c NPU

• 090 __ |a TP301.6/X2

• 093 __ |a TP301.6 |2 5

• 099 __ |a CAL 022013065534

• 100 1_ |a Benoit, Anne.

• 245 12 |a A guide to algorithm design : |b paradigms, methods, and complexity analysis / |c Anne Benoit, Yves Robert, and Frdric Vivien.

• 260 __ |a Boca Raton, FL : |b CRC Press/Taylor & Francis Croup, |c 2014.

• 300 __ |a xvii, 362 p. : |b ill. ; |c 24 cm.

• 490 0_ |a Chapman & Hall/CRC applied algorithms and data structures series

• 504 __ |a Includes bibliographical references and index.

• 520 __ |a Providing a comprehensive set of problem studies that builds on the authors expertise and class-tested material, this useful manual offers a guided exploration of methods and techniques to assess problem complexity in the study and design of algorithms. The first part of the text presents background material on the study of algorithms and algorithm design, addressing such basic paradigms as divide-and-conquer, dynamic programming, and greedy algorithms. It also covers NP-completeness and beyond NP-completeness, including approximation results. The second part of the text is devoted to case studies that exploit tools and techniques for assessing problem complexity.

• 650 _0 |a Computer algorithms.

• 650 _0 |a Data structures (Computer science)

• 700 1_ |a Robert, Yves.

• 700 1_ |a Vivien, Frdric