1 citations · 2 across the 5 of their papers we have counts for
9 papers
Approximation Algorithms for Discounted Graph Search with Norm Objectives
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm
We introduce a unified framework for classical search and routing problems, including pathwise search, expanding search, the minimum spanning tree problem, and the traveling salesp…
Carbon Pricing in Traffic Networks
Svenja M. Griesbach, Tobias Harks, Max Klimm +2
We study how externality pricing can steer traffic toward Wardrop equilibria respecting prescribed budgets. Our multi-commodity model encompasses carbon pricing, cordon pricing, an…
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…
Information Design for Congestion Games with Unknown Demand
Svenja M. Griesbach, Martin Hoefer, Max Klimm +1
We study a novel approach to information design in the standard traffic model of network congestion games. It captures the natural condition that the demand is unknown to the users…
Optimizing Throughput and Makespan of Queuing Systems by Information Design
Svenja M. Griesbach, Max Klimm, Philipp Warode +1
We study the optimal provision of information for two natural performance measures of queuing systems: throughput and makespan. A set of parallel links is equipped with determinist…
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…
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…
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…
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach +3
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of t…