Similar Search Results

Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7

Paschos, Vangelis Th. - In: RAIRO / Operations research 52 (2018) 1, pp. 305-314

Persistent link: https://www.econbiz.de/10011968720

Inverse chromatic number problems in interval and permutation graphs

Chung, Yerim; Culus, Jean-François; Demange, Marc - In: European journal of operational research : EJOR 243 (2015) 3, pp. 763-773

Persistent link: https://www.econbiz.de/10010513890

On some applications of the selective graph coloring problem

Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, … - In: European journal of operational research : EJOR 240 (2015) 2, pp. 307-314

Persistent link: https://www.econbiz.de/10010486255

On some applications of the selective graph coloring problem

Demange, Marc; Ekim, Tınaz; Ries, Bernard; Tanasescu, … - In: European Journal of Operational Research 240 (2015) 2, pp. 307-314

In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph coloring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the...

Persistent link: https://www.econbiz.de/10011097811

Parameterized (in)approximability of subset problems

Bonnet, Édouard; Paschos, Vangelis Th. - In: Operations research letters 42 (2014) 3, pp. 222-225

Persistent link: https://www.econbiz.de/10010383186

Dual parameterization and parameterized approximability of subset graph problems

Bonnet, Édouard; Paschos, Vangelis Th. - In: RAIRO / Operations research 51 (2017) 1, pp. 261-266

Persistent link: https://www.econbiz.de/10011774787