Before revision:  Example applications include the first constant-factor approximation algorithms whose running-time is polynomial in n for the following fundamental problems:
After revision:  As an example application, we provide the first constant-factor approximation algorithms whose running-time is polynomial in n for the following fundamental problems: