Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

PACKENUM

Financiado

PArameterized Complexity and Kernelization for ENUMeration

Algorithms play crucial roles in many aspects of the lives of billions of people worldwide. Many of the problems we wish to solve, in industry and academia, are NP-hard and it is expected that no polynomial-time algorithm exists t... ver más

07/07/2026

CNRS

141K€

Presupuesto del proyecto: 141K€

Líder del proyecto

CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2023-05-16

HORIZON-MSCA-2022-PF-01-01: MSCA Postdoctoral Fellowships 2022 ExpectedOutcome:

I+D

Cerrada hace 2 años

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

2 Participantes

CNRS

140.80K€ | Lider

UNIVERSITE DE MONTPELLIER

N.D. | Participante

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

ALGOCom Novel Algorithmic Techniques through the Lens of Combinatori... 1M€ Cerrado

CRACKNP Finding Cracks in the Wall of NP completeness 1M€ Cerrado

PID2019-106453GA-I00 ESTUDIO DE PROBLEMAS DE OPTIMIZACION COMBINATORIA Y RESOLUCI... 35K€ Cerrado

TIN2011-25448 TECNICAS DE OPTIMIZACION PARALELAS. HIBRIDACION DE COMPUTACI... 29K€ Cerrado

TIN2009-07727 METAHEURISTICAS MONO- Y MULTI-OBJETIVO PARA APLICACIONES REA... 147K€ Cerrado

Algacom Algorithms and Game Comonads 166K€ Cerrado

Duración del proyecto: 37 meses Fecha Inicio: 2023-05-16
Fecha Fin: 2026-07-07

Líder del proyecto

CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 141K€

Descripción del proyecto Algorithms play crucial roles in many aspects of the lives of billions of people worldwide. Many of the problems we wish to solve, in industry and academia, are NP-hard and it is expected that no polynomial-time algorithm exists to obtain an optimal solution for them. Nevertheless, they are solved millions of times on a daily basis. Solving them would be unfeasible without the use of preprocessing techniques, which significantly reduce running times and are often necessary to solve a problem. Explaining why these methods work in practice and designing new ones that come with performance guarantees is a great challenge in Theoretical Computer Science. In the framework of Parameterized Complexity, they are modeled through kernelization, which uses an additional measurement of the problem's structure (the parameter) to output a small equivalent instance that can be quickly solved. However, there will usually exist several optimal solutions, regardless of the optimality criterion, and drawing conclusions from a single one may be misleading. Knowing more about the set of optimal solutions is thus necessary in many scenarios and can be formalized through enumeration problems. Unlike decision problems, very little is known about preprocessing for enumeration problems. In the recently defined enumeration kernel, solutions to the reduced instance are used to partition and efficiently list the solution set of the input. Through this project, the researcher will design and implement novel parameterized algorithms and kernels for enumeration problems, and build the lower-bound theory required to separate problems between those that admit polynomial enumeration kernels and those that do not. The designed kernels will be some of the earliest enumeration kernels, while the lower-bound theory will be a fundamental part of Parameterized Complexity, allowing researcher's to identify problems that do not admit efficient preprocessing and focus their efforts on problems that do.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores