Dimitris Chatzidimitriou

collaborators

2 papers

cs.DS2015

An $O (lo g O P T)$ -approximation for covering and packing minor models of $θ_{r}$

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau +1

Given two graphs $G$ and $H$ , we define $v-cover_{H} (G)$ (resp. $e-cover_{H} (G)$ ) as the minimum number of vertices (resp. edges) whose removal from $G$ produces…

math.CO2015

Minors in graphs of large $θ_{r}$ -girth

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau +1

For every $r \in N$ , let $θ_{r}$ denote the graph with two vertices and $r$ parallel edges. The $θ_{r}$ -girth of a graph $G$ is the minimum number of edges of a subgraph of $G…

An O(logOPT)-approximation for covering and packing minor models of θr​

Minors in graphs of large θr​-girth

An $O (lo g O P T)$ -approximation for covering and packing minor models of $θ_{r}$

Minors in graphs of large $θ_{r}$ -girth