2 citations · 2 across the 1 of their papers we have counts for
5 papers
Solving the Multiobjective Quasi-Clique Problem
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1
Given a simple undirected graph , a quasi-clique is a subgraph of whose density is at least . Finding a maximum quasi-clique has been addressed from two…
Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem
François Clément, Carola Doerr, Kathrin Klamroth +1
Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Followin…
Ensuring connectedness for the Maximum Quasi-clique and Densest -subgraph problems
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1
Given an undirected graph , a quasi-clique is a subgraph of whose density is at least . Two optimization problems can be defined for quasi-cliques: the…
Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection
François Clément, Carola Doerr, LuÃs Paquete
Building upon the exact methods presented in our earlier work [J. Complexity, 2022], we introduce a heuristic approach for the star discrepancy subset selection problem. The heuris…
Constructing Optimal Star Discrepancy Sets
François Clément, Carola Doerr, Kathrin Klamroth +1
The star discrepancy is a very well-studied measure used to quantify the uniformity of a point set distribution. Constructing optimal point sets for this measure is se…