René van Bevern | DeepAI

AI Chat

Featured Co-authors

Rolf Niedermeier
71 publications
Matthias Mnich
28 publications
Till Fluschnik
23 publications
Philipp Zschoche
21 publications
André Nichterlein
20 publications
Matthias Bentert
19 publications
Oxana Yu. Tsidulko
8 publications
Daniel A. Skachkov
2 publications
Andrey Melnikov
2 publications
Pavel Smirnov
2 publications
Pavel V. Smirnov
2 publications

∙ 07/18/2022

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

The NP-hard graphical traveling salesman problem (GTSP) is to find a clo...

0 René van Bevern, et al. ∙

∙ 05/18/2022

On data reduction for dynamic vector bin packing

We study a dynamic vector bin packing (DVBP) problem. We show hardness f...

0 René van Bevern, et al. ∙

∙ 09/13/2021

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

The NP-hard Multiple Hitting Set problem is finding a minimum-cardinalit...

0 René van Bevern, et al. ∙

∙ 11/08/2020

The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable

The Hierarchical Chinese Postman Problem is finding a shortest traversal...

0 Vsevolod A. Afanasev, et al. ∙

∙ 04/06/2020

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

One of the most fundamental results in combinatorial optimization is the...

0 René van Bevern, et al. ∙

∙ 03/10/2020

Optimal-size problem kernels for d-Hitting Set in linear time and space

We improve two linear-time data reduction algorithms for the d-Hitting S...

0 René van Bevern, et al. ∙

∙ 10/01/2019

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions

Kernelization is the fundamental notion for polynomial-time prepocessing...

0 Matthias Bentert, et al. ∙

∙ 12/25/2018

On (1+ε)-approximate problem kernels for the Rural Postman Problem

Given a graph G=(V,E) with edge weights ω E→ N∪{0} and a subset R⊆ E of ...

0 René van Bevern, et al. ∙

∙ 06/29/2018

Fixed-parameter algorithms for maximum-profit facility location under matroid constraints

We consider a variant of the matroid median problem introduced by Krishn...

0 René van Bevern, et al. ∙

∙ 06/29/2018

Fixed-parameter algorithms for facility location under matroid constraints

We introduce a new uncapacitated discrete facility location problem, whe...

0 René van Bevern, et al. ∙

∙ 06/29/2018

Facility location under matroid constraints: fixed-parameter algorithms and applications

We study an NP-hard uncapacitated discrete facility location problem: Th...

0 René van Bevern, et al. ∙

∙ 06/25/2018

Parameterized algorithms and data reduction for the short secluded s-t-path problem

Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we sea...

0 René van Bevern, et al. ∙

∙ 06/25/2018

Parameterized algorithms and data reduction for safe convoy routing

We study a problem that models safely routing a convoy through a transpo...

0 René van Bevern, et al. ∙

∙ 12/18/2017

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs

Inductive k-independent graphs are a generalization of chordal graphs an...

0 Matthias Bentert, et al. ∙

∙ 09/06/2017

Parameterized complexity of machine scheduling: 15 open problems

Machine scheduling problems are a long-time key domain of algorithms and...

0 Matthias Mnich, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world