6.854J / 18.415J Advanced Algorithms, Fall 2001

Goemans, Michel

Author(s)

Goemans, Michel

Download6-854JFall2001/OcwWeb/Electrical-Engineering-and-Computer-Science/6-854JFall2001/CourseHome/index.htm (13.38Kb)

Alternative title

Advanced Algorithms

Terms of use

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.

Metadata

Show full item record

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. From the course home page: Course Description This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms. It is especially designed for doctoral students interested in theoretical computer science.

Date issued

2001-12

URI

http://hdl.handle.net/1721.1/49420

Department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics

Other identifiers

6.854J-Fall2001

local: 6.854J

local: 18.415J

local: IMSCP-MD5-c09f05c49504de4db7208f02529584ea

Keywords

Linear Programming, Network Flows, Approximation Algorithms, Planarity Testing of Graphs, Number-Theoretic Algorithms, Data Structures, 6.854J, 18.415J, 6.854, 18.415

Collections

MIT OCW Archived Courses