31 citations · 56 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
Cristina Bazgan, Stefan Ruzika, Clemens Thielen +1
We determine the power of the weighted sum scalarization with respect to the computation of approximations for general multiobjective minimization and maximization problems. Additi…
On the Universal Near Shortest Simple Paths Problem
Luca E. Schäfer, Andrea Maier, Stefan Ruzika
This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Ha…
A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding
Florian Gensheimer, Tobias Dietz, Kira Kraft +2
The Alternating Direction Method of Multipliers has recently been adapted for Linear Programming Decoding of Low-Density Parity-Check codes. The computation of the projection onto…