Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Voecking, Berthold - Fachgruppe Informatik, Rheinisch-Westfälische Technische Hochschule Aachen (RWTH)
Approximability of OFDMA Scheduling Marcel Ochel and Berthold Vocking
On the Impact of Combinatorial Structure on Congestion Games
Uncoordinated Two-Sided Matching Markets Heiner Ackermann
Inapproximability of Pure Nash Equilibria Alexander Skopalik, Berthold Vocking
Typical Properties of Winners and Losers in Discrete Optimization
Economical Caching With Stochastic Prices Matthias Englert1
Random Knapsack in Expected Polynomial Time rbeier@mpi-sb.mpg.de
Improved Algorithms for Latency Minimization in Wireless Networks Alexander Fanghnel
Oblivious Interference Scheduling Alexander Fanghnel
Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
Tight Bounds for Worst-Case Equilibria Artur Czumaj
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
Approximation Techniques for Utilitarian Mechanism Design
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP