Startpage »
Projects »
Publications »
Ortelius classification »
Help »
Approximation algorithms for connected subgraphs and tours
Help
Print
Here you can view and search the projects funded by NKFI since 2004
Back »
Details of project
Identifier
132524
Type
FK
Principal investigator
Pap, Gyula
Title in Hungarian
Approximációs algoritmusok összefüggő részgráfokra és bejárásokra
Title in English
Approximation algorithms for connected subgraphs and tours
Keywords in Hungarian
gráf, algoritmus
Keywords in English
graph, algorithm
Discipline
Mathematics (Council of Physical Sciences)
100 %
Ortelius classification:
Combinatorial analysis
Panel
Mathematics and Computing Science
Department or equivalent
HUN-REN ELTE Egerváry Research Group on Combinatorial Optimization (Office for Research Groups Attached to Universities and Other Institutions)
Participants
Bernáth, Attila
Király, Zoltán
Kovács, Erika Renáta
Starting date
2019-12-01
Closing date
2025-06-30
Funding (in million HUF)
27.088
FTE (full time equivalent)
9.50
state
running project
Back »
PUBv2.02 - © National Research, Development And Innovation Office
Security
»
Legal disclaimer
»
Sitemap
»
Impressum
»
Contact
»