research
∙
05/24/2023
Approximating Multiobjective Optimization Problems: How exact can you be?
It is well known that, under very weak assumptions, multiobjective optim...
share
research
∙
04/14/2022
Exact and approximate determination of the Pareto set using minimal correction subsets
Recently, it has been shown that the enumeration of Minimal Correction S...
research
∙
07/28/2021
Dense Graph Partitioning on sparse and dense graphs
We consider the problem of partitioning a graph into a non-fixed number ...
research
∙
08/28/2019
One-Exact Approximate Pareto Sets
Papadimitriou and Yannakakis show that the polynomial-time solvability o...
research
∙
08/03/2019
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
We determine the power of the weighted sum scalarization with respect to...
research
∙
03/15/2019
Proportionally dense subgraph of maximum size: complexity and approximation
We define a proportionally dense subgraph (PDS) as an induced subgraph o...
research
∙
06/28/2018
Graphs without a partition into two proportionally dense subgraphs
A proportionally dense subgraph (PDS) is an induced subgraph of a graph ...
research
∙
06/28/2018
Graphs without 2-community structures
In the context of community structure detection, we study the existence ...
research
∙
04/24/2018
