Algorithm design [[Book] /]Jon Kleinberg, Éva Tardos.
Von: Kleinberg, Jon.
Mitwirkende(r): Tardos, Éva.
Materialtyp:
BuchVerlag: Boston : Pearson/Addison-Wesley, 2006Beschreibung: 838 p. : ill. ; 24 cm.ISBN: 0321372913.Schlagwörter: Computer algorithms | Data structures (Computer science)DDC-Klassifikation: 005.1 Online-Ressourcen: Table of contents
Inhalte:
Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever.
| Medientyp | Aktueller Standort | Signatur | Exemplarnr. | Status | Fälligkeitsdatum |
|---|---|---|---|---|---|
Books
|
6october 1105 | 005.1 K A (Regal durchstöbern) | 1 | Verfügbar | |
|
Books
|
6october 1105 | 005.1 K A (Regal durchstöbern) | 2 | Verfügbar |
Includes bibliographical references (p. [805]-814) and index.
Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever.
All Ages.
Es gibt keine Kommentare zu diesem Titel.