MIT OpenCourseWare. MIT Challenge. Electricity and Magnetism. Algorithms for Planar Graphs and Beyond (Fall 2011) Erik Demaine, Shay Mozes, Christian Sommer, Siamak Tazari [Home] [Problem Sets] [Project] [Lectures] [Problem Session Notes] [Klein's Book] Overview Solve your favorite problems faster for graphs that matter!
Graphs in the real world tend to have a lot of special structure. In particular, graphs arising on this planet are often planar (or nearly so), meaning that they can be drawn in the plane or a sphere without any (or with few) edge crossings. We will organize an optional problem-solving session, during which we can jointly try to solve open problems. Class projects more generally can take the form of formulations of clean, new open problems; implementations of existing algorithms; or well-written descriptions of one or more papers in the area. Topics Algorithms for Fundamental Problems: shortest paths, multiple source shortest paths, distance oracles, min-cut, max-flow, TSP, subset TSP, and Steiner tree Specifics Participating Previous Offerings.
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2010) Prof.
Erik Demaine [Home] [Problem Sets] [Project] [Lectures] [Problem Session Notes] Overview the algorithms behind building TRANSFORMERS and designing ORIGAMI Whenever you have a physical object to be reconfigured, geometric folding often comes into play. We will organize an optional problem-solving session, during which we can jointly try to solve open problems in folding. Class projects more generally can take the form of folding-inspired sculptures; formulations of clean, new open problems; implementations of existing algorithms; or well-written descriptions of one or more papers in the area. Topics This is an advanced class on computational geometry focusing on folding and unfolding of geometric structures including linkages, proteins, paper, and polyhedra. Textbook The textbook for the class is Geometric Folding Algorithms: Linkages, Origami, Polyhedra by Erik Demaine and Joseph O'Rourke, published by Cambridge University Press (2007).
Specifics Participating. Advanced Data Structures (6.851) Prof.
Erik Demaine TAs: Tom Morgan, Justin Zhang [Home] [Lectures] [Assignments] [Project] [Problem Session] Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. Specifics Lecture time: Tuesday & Thursday 11–12:30 First lecture: Tuesday, February 7, 2012 Lecture room: 4-163 Units: 3-0-9, H-level & EC credit Registration: Subscribe to 6851-students mailing list on the web.
Prerequisites The required prerequisite is 6.046, Design and Analysis of Algorithms or an equivalently thorough undergraduate algorithms class from another school (e.g., covering much of CLRS). Grading There are three requirements, other than attending lectures: Scribing one, maybe two, lectures. LaTeX Help Homework solutions, scribe notes, and final projects must be typeset in LaTeX.