| dc.contributor.author | Karger, David | en_US |
| dc.coverage.temporal | Fall 1999 | en_US |
| dc.date.issued | 1999-12 | |
| dc.identifier | 6.854J-Fall1999 | |
| dc.identifier | local: 6.854J | |
| dc.identifier | local: 18.415J | |
| dc.identifier | local: IMSCP-MD5-b8fc2f457ab7c0e64a75e8cc2f806ed8 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/36897 | |
| dc.description.abstract | A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational geometry. Approximation algorithms. Alternate years. | en_US |
| dc.language | en-US | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
| dc.subject | fundamental algorithms | en_US |
| dc.subject | implementation | en_US |
| dc.subject | data structures | en_US |
| dc.subject | network flows | en_US |
| dc.subject | linear programming | en_US |
| dc.subject | computational geometry | en_US |
| dc.subject | approximation algorithms | en_US |
| dc.subject | algorithmic design | en_US |
| dc.subject | algorithmic analysis | en_US |
| dc.subject | string algorithms | en_US |
| dc.subject | maximum flows | en_US |
| dc.subject | online algorithms | en_US |
| dc.subject | scheduling | en_US |
| dc.subject | external memory algorithms | en_US |
| dc.subject | 6.854J | en_US |
| dc.subject | 18.415J | en_US |
| dc.subject | 6.854 | en_US |
| dc.subject | 18.415 | en_US |
| dc.subject | Algorithms | en_US |
| dc.title | 6.854J / 18.415J Advanced Algorithms, Fall 1999 | en_US |
| dc.title.alternative | Advanced Algorithms | en_US |
| dc.type | Learning Object | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
