Skip to content

Author

R. Zenklusen

We have 3 of 116 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases

It is shown that the problem of maximizing a monotone submodular function over maximum cardinality sets in the intersection of two matroids on a common ground set is approximation-equivalent to Submodular Orienteering in directed graphs and an improved polynomial-time bicriteria approximation is obtained via a local se...

Chandra Chekuri, Lars Rohwedder, Neta Singer et al. · 0 citations
#machine learning Preprint Sep 2026

Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular Orienteering

A novel LP-based algorithm for Submodular Orienteering using ideas from the Sherali-Adams hierarchy and Round-or-Cut is presented and a trade-off between the approximation guarantee and the number of previously visited vertices on which an agent conditions its decision is revealed.

Lars Rohwedder, R. Zenklusen · 1 citation
Open access Jul 2026

Single-source unsplittable flows in planar and bounded-genus graphs

The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to terminals with unrelated demands, each terminal being served through a single path. The classical SSUF objective is to minimize the violation of some given arc capacities. A seminal result of Dinitz, Garg, and Goemans showed...

Vera Traub, Laura Vargas Koch, R. Zenklusen · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.