From the 1 of 6 linked papers with an AI index.
6 papers
Approximation Algorithms for Discounted Graph Search with Norm Objectives
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm
The paper proposes a unified model for graph search and routing problems that incorporates discounted edge costs and a p‑norm objective, and provides constant‑factor approximation…
Public Signals in Network Congestion Games
Svenja M. Griesbach, Martin Hoefer, Max Klimm +1
We consider a largely untapped potential for the improvement of traffic networks that is rooted in the inherent uncertainty of travel times. Travel times are subject to stochastic…
Carbon Pricing in Traffic Networks
Svenja M. Griesbach, Tobias Harks, Max Klimm +2
Traffic is a significant source of global carbon emissions. In this paper, we study how carbon pricing can be used to guide traffic towards equilibria that respect given emission b…
Improved Approximation Algorithms for the Expanding Search Problem
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm +1
A searcher is tasked with exploring a graph with edge lengths and vertex weights, starting from a designated vertex. Initially, only the starting vertex is considered explored. At…
Deterministic Impartial Selection with Weights
Javier Cembrano, Svenja M. Griesbach, Maximilian J. Stahlberg
In the impartial selection problem, a subset of agents up to a fixed size among a group of is to be chosen based on votes cast by the agents themselves. A selection mechani…
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
Yann Disser, Svenja M. Griesbach, Max Klimm +1
We consider an incremental variant of the rooted prize-collecting Steiner-tree problem with a growing budget constraint. While no incremental solution exists that simultaneously ap…