CAREER: Improved Approximation Algorithms for Graph Problems — NSF Award to Trustees of Boston University (MA, $412,038)
Graphs are used to model transportation networks, social networks, the internet, and many other systems of major significance. A number of important computational problems naturally arise on these graphs. For example, one may wish to find the shortest route visiting all points – in other words, to solve the traveling s
| Award title | CAREER: Improved Approximation Algorithms for Graph Problems |
|---|---|
| Award ID | 2442250 |
| Awardee | Trustees of Boston University |
| City | BOSTON |
| State | MA |
| Amount obligated | $412,038 |
| Principal investigator | Nathan Klein |
| Program | Algorithmic Foundations |
| Start date | 10/01/2025 |
| Abstract | Graphs are used to model transportation networks, social networks, the internet, and many other systems of major significance. A number of important computational problems naturally arise on these graphs. For example, one may wish to find the shortest route visiting all points – in other words, to solve the traveling salesperson problem. Unfortunately, this problem and many others like it are believed to be computationally intractable, requiring lifetimes of computation to solve exactly. However |
| Source | NSF Awards |
$799/mo
Try NSFGrants →