Loading...
Please wait, while we are loading the content...
Similar Documents
Exercises going beyond NP-completeness
| Content Provider | Scilit |
|---|---|
| Author | Benoit, Anne Robert, Yves Vivien, Frédéric |
| Copyright Year | 2013 |
| Description | This chapter presents a set of exercises related to Chapter 8. The main focus is on approximation results (Section 9.1), and there are also exercises dealing with linear programming, randomized algorithms, and branch-and-bound techniques (Section 9.2). Solutions are provided in Section 9.3. Book Name: A Guide to Algorithm Design |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2009-0-02098-4&isbn=9780429428890&doi=10.1201/9780429428890-13&format=pdf |
| Ending Page | 256 |
| Page Count | 28 |
| Starting Page | 229 |
| DOI | 10.1201/9780429428890-13 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2013-08-27 |
| Access Restriction | Open |
| Subject Keyword | Book Name: A Guide To Algorithm Design Randomized Algorithms Branch Approximation Results Np Completeness Chapter Presents Exercises Dealing Completeness This Chapter |
| Content Type | Text |
| Resource Type | Chapter |