Approximation algorithms

Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 106 separate “yes” or “no” decisions to be made. Although one could, in principle, try all 2106 possible solutions to find the optimal one, such a method would be impractically slow. Unfortunately, for most of these models, no algorithms are known that find optimal solutions with reasonable computation times. Typically, industry must rely on solutions of unguaranteed quality that are constructed in an ad hoc manner. Fortunately, for some of these models there are good approximation algorithms: algorithms that produce solutions quickly that are provably close to optimal. Over the past 6 years, there has been a sequence of major breakthroughs in our understanding of the design of approximation algorithms and of limits to obtaining such performance guarantees; this area has been one of the most flourishing areas of discrete mathematics and theoretical computer science.

Cue recognition and cue elaboration in learning from examples.

This paper describes the processes used by students to learn from worked-out examples and by working through problems. Evidence is derived from protocols of students learning secondary school mathematics and physics. The students acquired knowledge from the examples in the form of productions (condition-->action): first discovering conditions under which the actions are appropriate and then elaborating the conditions to enhance efficiency. Students devoted most of their attention to the condition side of the productions. Subsequently, they generalized the productions for broader application and acquired specialized productions for special problem classes.