About: New combinatorial algorithms - decompositions, parameterization, efficient solutions     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Projekt, within Data Space : linked.opendata.cz:8890 associated with source document(s)

AttributesValues
rdf:type
Description
  • Cílem projektu je řada matematických poznatků, zejména tvrzení o složitosti problému, strukturálních vět o matematických objektech, návrhy příslušných algoritmů a jejich experimentální implementace. Matematické poznatky budou publikované formou článků v mezinárodních impaktovaných časopisech a představené na mezinárodních výběrových konferencích. (cs)
  • The project brings new mathematical results concerning optimizing combinatorial problems. As a necessary requirement for the development of efficient algorithms the project focuses on structural dependencies of the studied problems in terms of graph decompositions and various structural parameters. The studied dependency of the solution of the problem on parameters will be a core clue for the design of algorithms. These algorithms will have polynomial running time, if possible, or alternatively the running time will be exponential but with smallest possible base of the exponent (so called fast exponential algorithms). The problems will be chosen from the area of telecommunication, transport and resource management. (en)
Title
  • Nové kombinatorické algoritmy - rozklady instancí, parametry úloh a jejich efektivní řešení (cs)
  • New combinatorial algorithms - decompositions, parameterization, efficient solutions (en)
http://linked.open...vai/cislo-smlouvy
http://linked.open...avai/druh-souteze
http://linked.open...domain/vavai/faze
http://linked.open...vavai/hlavni-obor
http://linked.open...vai/vedlejsi-obor
http://linked.open...vavai/id-aktivity
http://linked.open.../vavai/id-souteze
http://linked.open...n/vavai/kategorie
http://linked.open...vai/klicova-slova
  • computational complexity; parameterized complexity; graph decompositions; graph classes; fast exponential algorithms; structural complexity (en)
http://linked.open...avai/konec-reseni
http://linked.open...nujicich-prijemcu
http://linked.open...avai/poskytovatel
http://linked.open...avai/start-reseni
http://linked.open...ai/statni-podpora
http://linked.open...vavai/typProjektu
http://linked.open...ai/uznane-naklady
http://linked.open...ai/pocet-prijemcu
http://linked.open...cet-spoluprijemcu
http://linked.open...ai/pocet-vysledku
http://linked.open...ku-zverejnovanych
is http://linked.open...ain/vavai/projekt of
Faceted Search & Find service v1.16.121 as of Mar 31 2025


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3240 as of Mar 31 2025, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 40 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software