(In) approximability of maximum minimal FVS
We study the approximability of the NP-complete Maximum Minimal Feedback Vertex Set
problem. Informally, this natural problem seems to lie in an intermediate space between two …
problem. Informally, this natural problem seems to lie in an intermediate space between two …
Algorithmic aspects of upper edge domination
We study the problem of finding a minimal edge dominating set of maximum size in a given
graph G=(V, E), called Upper EDS. We show that this problem is not approximable within a …
graph G=(V, E), called Upper EDS. We show that this problem is not approximable within a …
Extension of some edge graph problems: Standard, parameterized and approximation complexity
We consider extension variants of some edge optimization problems in graphs containing
the classical Edge Cover, Matching, and Edge Dominating Set problems and …
the classical Edge Cover, Matching, and Edge Dominating Set problems and …
Contributions to approximation and parameterization in combinatorial optimization
N Melissinos - 2022 - theses.hal.science
The study of combinatorial problems is an important task as they are abstraction of many
problems that we face in our lifefor a very long time. In this thesis we study variants of …
problems that we face in our lifefor a very long time. In this thesis we study variants of …
[PDF][PDF] Louis Dublois
T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos - researchgate.net
We study the approximability of the NP-complete Maximum Minimal Feedback Vertex Set
problem. Informally, this natural problem seems to lie in an intermediate space between two …
problem. Informally, this natural problem seems to lie in an intermediate space between two …