(In)approximability of maximum minimal FVS

Autor: Dublois, Louis ^a, Hanaka, Tesshu ^{b, ⁎}, Khosravian Ghadikolaei, Mehdi ^a, Lampis, Michael ^a, Melissinos, Nikolaos ^a

Publikováno v: In Journal of Computer and System Sciences March 2022 124:26-40

On the complexity of solution extension of optimization problems

Autor: Casel, Katrin ^{a, ⁎}, Fernau, Henning ^{b, ⁎}, Khosravian Ghadikolaei, Mehdi ^{c, ⁎}, Monnot, Jérôme ^c, Sikora, Florian ^{c, ⁎}

Publikováno v: In Theoretical Computer Science 15 February 2022 904:48-65

Abundant Extensions

Autor: Casel, Katrin, Fernau, Henning, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian

Publikováno v: Algorithms and Complexity
Algorithms and Complexity, 12701, Springer International Publishing, pp.3-19, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-75242-2_1⟩

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f5fcd077b45d5bdf7cdff57134db2639
https://hal.archives-ouvertes.fr/hal-03457150

Extension of NP Optimization Problems

Autor: KHOSRAVIAN GHADIKOLAEI, Mehdi

Publikováno v: Computational Geometry [cs.CG]. Université Paris sciences et lettres, 2019. English. ⟨NNT : 2019PSLED064⟩

The problem of determining the quality of a partial solution occurs in almost every algorithmic approach that gradually computes a global solution. Pruning search trees, proving approximation guarantees, or the efficiency of enumeration strategies us

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ba4207288baf55be10895d9841230e1b
https://tel.archives-ouvertes.fr/tel-03220653/file/2019PSLED064.pdf