Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Penninkx, Eelko"'
Autor:
Bodlaender, Hans L., Fomin, Fedor V., Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket, Thilikos, Dimitrios M.
In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k, while preserving the answer. In thi
Externí odkaz:
http://arxiv.org/abs/0904.0727
Autor:
Bodlaender, Hans L., Feremans, Corinne, Grigoriev, Alexander, Penninkx, Eelko, Sitters, René, Wolle, Thomas
Publikováno v:
In Computational Geometry: Theory and Applications 2009 42(9):939-951
Autor:
BODLAENDER, HANS L., FOMIN, FEDOR V., LOKSHTANOV, DANIEL, PENNINKX, EELKO, SAURABH, SAKET, THILIKOS, DIMITRIOS M.
Publikováno v:
Journal of the ACM; Nov2016, Vol. 63 Issue 5, p1-69, 69p
Autor:
Bodlaender, Hans L., Fomin, Fedor V., Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket, Thilikos, Dimitrios M.
Complete version of the paper of FOCS 2009; In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::0e748752a2a9825e90244604fa186d26
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00904532
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00904532
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::8aebaaf469ca6e3c2ce220fd0579c555
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3140744
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3140744
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Sofsem 2011: Theory & Practice of Computer Science; 2011, p444-454, 11p
Publikováno v:
Parameterized & Exact Computation (9783642112683); 2009, p50-60, 11p
Publikováno v:
Algorithms & Computation (9783540921813); 2008, p306-317, 12p
Autor:
Bodlaender, Hans L., Penninkx, Eelko
Publikováno v:
Parameterized & Exact Computation (9783540797227); 2008, p160-171, 12p