Coverart for item
The Resource A guide to algorithm design : paradigms, methods, and complexity analysis, Anne Benoit, Yves Robert, and Frédérick Vivien

A guide to algorithm design : paradigms, methods, and complexity analysis, Anne Benoit, Yves Robert, and Frédérick Vivien

Label
A guide to algorithm design : paradigms, methods, and complexity analysis
Title
A guide to algorithm design
Title remainder
paradigms, methods, and complexity analysis
Statement of responsibility
Anne Benoit, Yves Robert, and Frédérick Vivien
Creator
Contributor
Author
Subject
Language
eng
Member of
Cataloging source
AU@
http://library.link/vocab/creatorName
Benoit, Anne
Index
index present
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1938-
http://library.link/vocab/relatedWorkOrContributorName
  • Robert, Yves
  • Vivien, Frédéric
Series statement
Chapman & Hall/CRC applied algorithms and data structures series
http://library.link/vocab/subjectName
  • Computer algorithms
  • Computational complexity
Label
A guide to algorithm design : paradigms, methods, and complexity analysis, Anne Benoit, Yves Robert, and Frédérick Vivien
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Greedy algorithms
  • 4.
  • Dynamic programming
  • 5.
  • Amortized analysis
  • 6.
  • NP-completeness
  • 7.
  • Exercises on NP-completeness
  • 8.
  • Machine generated contents note:
  • Beyond NP-completeness
  • 9.
  • Exercises going beyond NP-completeness
  • 10.
  • Reasoning to assess a problem complexity
  • 11.
  • Chains-on-chains partitioning
  • 12.
  • Replica placement in tree networks
  • 13.
  • I.
  • Packet routing
  • 14.
  • Matrix product, or tiling the unit square
  • 15.
  • Online scheduling
  • Polynomial-time algorithms: Exercises
  • 1.
  • Introduction to complexity
  • 2.
  • Divide-and-conquer
  • 3.
Control code
ocn870251386
Dimensions
25 cm
Extent
xvii, 362 pages
Isbn
9781439825648
Isbn Type
(hardback)
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
System control number
(OCoLC)870251386
Label
A guide to algorithm design : paradigms, methods, and complexity analysis, Anne Benoit, Yves Robert, and Frédérick Vivien
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Greedy algorithms
  • 4.
  • Dynamic programming
  • 5.
  • Amortized analysis
  • 6.
  • NP-completeness
  • 7.
  • Exercises on NP-completeness
  • 8.
  • Machine generated contents note:
  • Beyond NP-completeness
  • 9.
  • Exercises going beyond NP-completeness
  • 10.
  • Reasoning to assess a problem complexity
  • 11.
  • Chains-on-chains partitioning
  • 12.
  • Replica placement in tree networks
  • 13.
  • I.
  • Packet routing
  • 14.
  • Matrix product, or tiling the unit square
  • 15.
  • Online scheduling
  • Polynomial-time algorithms: Exercises
  • 1.
  • Introduction to complexity
  • 2.
  • Divide-and-conquer
  • 3.
Control code
ocn870251386
Dimensions
25 cm
Extent
xvii, 362 pages
Isbn
9781439825648
Isbn Type
(hardback)
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
System control number
(OCoLC)870251386

Library Locations

    • Albany LibraryBorrow it
      Gate 1, East Precinct, Albany Expressway (SH17), Albany, Auckland, 0632, NZ
      -36.733330 174.700641
Processing Feedback ...