René Beier - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2023

The smoothed number of Pareto-optimal solutions in bicriteria integer optimizationRené Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking. mp, 200(1):319-355, 2023. [doi]

2012

Scalable Generation of Synthetic GPS Traces with Real-Life Data CharacteristicsKonrad Bösche, Thibault Sellam, Holger Pirk, René Beier, Peter Mieth, Stefan Manegold. In TPCTC. 2012: 140-155 [doi]

2011

The Knapsack ProblemRené Beier, Berthold Vöcking. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 375-381, Springer, 2011. [doi]

2007

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer OptimizationRené Beier, Heiko Röglin, Berthold Vöcking. ipco 2007: 53-67 [doi]

2006

Typical Properties of Winners and Losers in Discrete OptimizationRené Beier, Berthold Vöcking. SICOMP, 35(4):855-881, 2006. [doi]

An Experimental Study of Random Knapsack ProblemsRené Beier, Berthold Vöcking. algorithmica, 45(1):121-136, 2006. [doi]

Computing equilibria for a service provider game with (Im)perfect informationRené Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking. TALG, 2(4):679-706, 2006. [doi]

2005

Probabilistic analysis of discrete optimization problemsRené Beier. PhD thesis, Saarland University, 2005. [doi]

2004

2003

Smoothed Analysis of Three Combinatorial ProblemsCyril Banderier, René Beier, Kurt Mehlhorn. mfcs 2003: 198-207 [doi]

Random knapsack in expected polynomial timeRené Beier, Berthold Vöcking. stoc 2003: 232-241 [doi]

2002

Energy Optimal Routing in Radio Networks Using Geometric Data StructuresRené Beier, Peter Sanders, Naveen Sivadasan. icalp 2002: 366-376 [doi]

2000

A powerful heuristic for telephone gossipingRené Beier, Jop F. Sibeyn. sirocco 2000: 17-35

Sign in or sign up to see more results.

runs on WebDSL