Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Beier, René - Max-Planck-Institut für Informatik
Random Knapsack in Expected Polynomial Time Rene Beier #
A Powerful Heuristic for Telephone RENE BEIER AND JOP F. SIBEYN
Probabilistic Analysis of Knapsack Core Algorithms Rene Beier #
Typical Properties of Winners and Losers in Discrete Optimization
Fast Energy Optimal Routing in Radio Networks Using Geometric Data Structures
Computing Equilibria for Congestion Games with (Im)perfect Information
An Experimental Study of Random Knapsack Rene Beier 1 and Berthold Vocking 2
Smoothed Analysis of Three Combinatorial Cyril Banderier 1 , Rene Beier 2 , and Kurt Mehlhorn 2
