1 citations · 1 across the 3 of their papers we have counts for
4 papers
Approximating Biobjective Minimization Problems Using General Ordering Cones
Arne Herzel, Stephan Helfrich, Stefan Ruzika +1
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal w…
One-Exact Approximate Pareto Sets
Arne Herzel, Cristina Bazgan, Stefan Ruzika +2
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit…
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a secon…
Complexity of Strong Implementability
Clemens Thielen, Sven O. Krumke
We consider the question of implementability of a social choice function in a classical setting where the preferences of finitely many selfish individuals with private information…