Kathrin Klamroth

most citedOn the representation of the search region in multi-objective optimization

91 citations · 122 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024★ 1 cited

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$ -subgraph problems

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given an undirected graph $G$ , a quasi-clique is a subgraph of $G$ whose density is at least $γ$ $(0 < γ \leq 1)$ . Two optimization problems can be defined for quasi-cliques: the Ma…

cs.DM2015★ 91 cited

On the representation of the search region in multi-objective optimization

Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten

Given a finite set $N$ of feasible points of a multi-objective optimization (MOO) problem, the search region corresponds to the part of the objective space containing all the point…

Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems

On the representation of the search region in multi-objective optimization

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$ -subgraph problems