On the parameterized complexity of dynamic problems
In a dynamic version of a (base) problem X it is assumed that some solution to an instance of X is no longer feasible due to changes made to the original instance, and it is required that a new feasible solution be obtained from what “remained” from the original solution at a minimal cost. In the pa...
محفوظ في:
| المؤلف الرئيسي: | Abu-Khzam, Faisal N. (author) |
|---|---|
| مؤلفون آخرون: | Egan, Judith (author), Fellows, Michael R. (author), Rosamond, Frances A. (author), Shaw, Peter (author) |
| التنسيق: | article |
| منشور في: |
2015
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/4761 http://dx.doi.org/10.1016/j.tcs.2015.06.053 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.sciencedirect.com/science/article/pii/S0304397515005630 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
On the parameterized parallel complexity and the vertex cover problem
حسب: Abu-Khzam, Faisal N.
منشور في: (2016) -
On the complexity of multi-parameterized cluster editing
حسب: Abu-Khzam, Faisal
منشور في: (2017) -
The multi-parameterized cluster editing problem
حسب: Abu-Khzam, Faisal N.
منشور في: (2017) -
On the complexity of various parameterizations of common induced subgraph isomorphism
حسب: Abu-Khzam, Faisal N.
منشور في: (2017) -
A direct algorithm for the parameterized face cover problem
حسب: Abu-Khzam, Faisal N.
منشور في: (2017)