Project Grant 2313372
- This $412,038 CAREER (Careers in Teaching and Research) award from the National Science Foundation's Division of Computing and Communication Foundations under the Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports a five-year research project at Boston University running from October 1, 2025, through September 30, 2030. The project develops improved approximation algorithms for NP-hard graph problems that are computationally intractable to solve exactly. The...
- This National Science Foundation project grant of $362,015 supports research into developing more fine-grained algorithms under the Computer and Information Science and Engineering program. The University of California, San Diego will conduct this research from November 2021 to January 2023. Specifically, the awardee will build a unified theory of designing fast approximation algorithms and study their fine-grained computational hardness. They will develop systematic techniques emphasizing...
- New York University was awarded a $350,000 Project Grant from the National Science Foundation Division of Computing and Communication Foundations on October 1, 2021 to support research on the "Hardness of Approximation: Classical and New" through September 30, 2024. The grant is part of the NSF's Computer and Information Science and Engineering program (CFDA 47.070), which aims to advance computing and information sciences through investigator-initiated research and development of...
- This $600,000 National Science Foundation project grant supports research into the Unique Games Conjecture and related problems in the hardness of approximation. Funded under the NSF's Computer and Information Science and Engineering program from April 2022 through March 2025, the award supports two components. First, the grantee will collaborate with experts in geometric functional analysis and probability to analyze a reduction from an NP-hard problem to Boolean unique games. This builds on...
- This four-year, $1.2 million Project Grant from the National Science Foundation's Division of Computing and Communication Foundations will support research in algorithms and complexity for total functions. Funded under the Computer and Information Science and Engineering program, the grant aims to advance understanding of the efficient solvability of important computational problems where a solution is guaranteed to exist, but may still be difficult to find. Specifically, the Columbia University...
- This three-year $600,000 project grant from the National Science Foundation's (NSF) Computer and Information Science and Engineering program (CFDA 47.070) will support theoretical computer science research and education at the University of California, Los Angeles (UCLA). The principal investigator will conduct research on representations of computational objects by real polynomials, with a focus on pointwise approximation techniques. This includes tackling open problems in the pointwise...
- This Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program supports research on the streaming approximability of constraint satisfaction problems, with a focus on the Maximum Directed Cut (Max-DiCut) problem. The $174,991 award to the Toyota Technological Institute at Chicago (TTIC), a private non-profit university, will fund efforts to design more efficient streaming algorithms for Max-DiCut and other constraint...
- This Project Grant award under the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) will support the development of general algorithmic frameworks and frameworks for analyzing and manipulating various types of real-world networks, such as gene regulatory networks, brain networks, and online social networks. The $320,000 award to the Massachusetts Institute of Technology (MIT) will fund research to create provably-efficient...
- This $199,006 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program supports fundamental and applied research across computational domains. The project aims to investigate the tractability and intractability of important computational problems, including advancing the understanding of electoral methods and the training of large language models and other AI tools. The award will also provide training for graduate...
- The National Science Foundation (NSF) has awarded a $620,000 Project Grant under the CFDA 47.070 Computer and Information Science and Engineering Program to the University of Illinois. The grant is for a 3-year period from June 1, 2024 to May 31, 2027. The project aims to develop algorithms for partitioning and connectivity problems involving submodular functions and hypergraphs. Key focus areas include: Investigating polynomial-time solvability of the partitioning problem for submodular...
AF: SMALL: HARDNESS OF APPROXIMATION MEETS PARAMETERIZED COMPLEXITY -MANY IMPORTANT OPTIMIZATION PROBLEMS ARE NOT TRACTABLE. TWO TYPICAL WAYS TO COPE WITH THE INTRACTABILITY OF OPTIMIZATION PROBLEMS IS TO EITHER DESIGN ALGORITHMS THAT FIND SOLUTIONS WHOSE COST IS CLOSE TO THE OPTIMUM OR DESIGN ALGORITHMS WHICH FIND EXACT SOLUTIONS BUT RUN IN TIME PURELY POLYNOMIAL IN THE INPUT SIZE BUT EXPONENTIAL (OR POSSIBLY WORSE) IN TERMS OF A PARAMETER OF THE PROBLEM (REFERRED TO AS FIXED PARAMETER TRACTABILITY RUNTIME). FOR SEVERAL OPTIMIZATION PROBLEMS, IT IS POSSIBLE TO PROVE THAT (I) FINDING GOOD APPROXIMATE SOLUTIONS IS AS HARD AS FINDING OPTIMAL SOLUTIONS, AND (II) FOR SPECIFIC PARAMETERS OF INTEREST, UNDER PLAUSIBLE ASSUMPTIONS, THE PROBLEM DOES NOT ADMIT ALGORITHMS WITH FIXED PARAMETER TRACTABILITY RUNTIME. IN FACT, FOR MANY IMPORTANT PROBLEMS, IT IS POSSIBLE TO PROVE THAT FOR SPECIFIC PARAMETERS OF INTEREST, AND UNDER PLAUSIBLE ASSUMPTIONS, THE PROBLEM DOES NOT EVEN ADMIT ALGORITHMS COMPUTING ONLY AN APPROXIMATE SOLUTION WHILE HAVING FIXED PARAMETER TRACTABILITY RUNTIME. THIS PROJECT CONCERNS THE STUDY OF SUCH INAPPROXIMABILITY RESULTS. THE RESEARCH GOALS OF THE PROJECT WILL BE INTEGRATED WITH TEACHING, MENTORING, AND DISSEMINATION ACTIVITIES. THE RESEARCH WILL INVOLVE PARTICIPATION OF GRADUATE STUDENTS AND POST- DOCTORAL FELLOWS. THIS PROJECT DEALS WITH THE CHALLENGING TASK OF DEVELOPING THE NASCENT AREA ARISING FROM THE INTERSECTION OF HARDNESS OF APPROXIMATION AND PARAMETERIZED COMPLEXITY, DRAWING FROM TOOLKITS IN CODING THEORY, EXTREMAL COMBINATORICS, AND ANALYSIS OF BOOLEAN FUNCTIONS. THE PROBLEMS THAT ARE PLANNED TO BE INVESTIGATED IN THIS PROJECT ARE ESSENTIALLY THE SAME PROBLEMS PURSUED IN THE 1990S IN THE NON-DETERMINISTIC POLYNOMIAL (NP) WORLD WHICH THEN FORMED THE BEDROCK OF HARDNESS OF APPROXIMATION RESULTS THEREIN. IN THE NP WORLD, THESE RESULTS (AND THE TECHNIQUES DEVELOPED) SERVED AS THE STARTING POINT TO PROVE THE INAPPROXIMABILITY OF VARIOUS OTHER PROBLEMS OF INTEREST TO THE THEORETICAL COMPUTER SCIENCE COMMUNITY (SUCH AS CLUSTERING, TRAVELLING SALESMAN PROBLEM, SCHEDULING PROBLEMS, ETC.). UPON SUCCESSFULLY ANSWERING THE QUESTIONS IN THIS PROJECT, RESEARCHERS IN PARAMETERIZED COMPLEXITY WILL HAVE SUFFICIENT RESULTS AND TOOLS AT THEIR DISPOSAL TO PROVE THE HARDNESS OF APPROXIMATION FOR THE PROBLEMS OF THEIR INTEREST. THIS AWARD REFLECTS NSF'S STATUTORY MISSION AND HAS BEEN DEEMED WORTHY OF SUPPORT THROUGH EVALUATION USING THE FOUNDATION'S INTELLECTUAL MERIT AND BROADER IMPACTS REVIEW CRITERIA.
Mod # | Description | ReasonForModification | Federal Obligation | Date |
|---|---|---|---|---|
| Not listed | $10.0k | 4/24/25 | ||
| Not listed | $0 | 4/16/25 | ||
| Not listed | $600.0k | 5/31/23 |
GrantNumber | Description | Subgrantee | Prime Award | Dollars Obligated | Updated At |
|---|---|---|---|---|---|
3715835204FDPS | New York University | Project Grant 2313372 | $44.8k | 7/2/25 |