activity
20162025
most citedAn Experimental Study of ILP Formulations for the Longest Induced Path Problem

7 citations · 7 across the 5 of their papers we have counts for

collaborators

7 papers

cs.DS2025

Simple Approximations for General Spanner Problems

Fritz Bökler, Markus Chimani, Henning Jasper

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgra…

cs.DS2024

Exact Minimum Weight Spanners via Column Generation

Fritz Bökler, Markus Chimani, Henning Jasper +1

Given a weighted graph , a minimum weight -spanner is a least-weight subgraph that preserves minimum distances between all node pairs up to a factor of . Th…

cs.DM2022

PaMILO: A Solver for Multi-Objective Mixed Integer Linear Optimization and Beyond

Fritz Bökler, Levin Nemesch, Mirko H. Wagner

In multi-objective optimization, several potentially conflicting objective functions need to be optimized. Instead of one optimal solution, we look for the set of so called non-dom…

cs.CC2022

Complexity of the Multiobjective Spanner Problem

Fritz Bökler, Henning Jasper

In this paper, we take an in-depth look at the complexity of a hitherto unexplored Multiobjective Spanner (MSp) problem. The MSp is a multiobjective generalization of the well-stud…

cs.DS2020★ 7 cited

An Experimental Study of ILP Formulations for the Longest Induced Path Problem

Fritz Bökler, Markus Chimani, Mirko H. Wagner +1

Given a graph , the longest induced path problem asks for a maximum cardinality node subset such that the graph induced by is a path. It is a long estab…

math.OC2016

Output-sensitive Complexity of Multiobjective Combinatorial Optimization

Fritz Bökler, Matthias Ehrgott, Christopher Morris +1

We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general e…

cs.DS2016

Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem

Fritz Bökler, Petra Mutzel

In this paper, we re-evaluate the basic strategies for label correcting algorithms for the multiobjective shortest path (MOSP) problem, i.e., node and label selection. In contrast…