Berthold Vöcking

From MaRDI portal
Revision as of 11:52, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Berthold Vöcking to Berthold Vöcking: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:352246

Available identifiers

zbMath Open vocking.bertholdMaRDI QIDQ352246

List of research outcomes





PublicationDate of PublicationType
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization2023-05-25Paper
https://portal.mardi4nfdi.de/entity/Q57434412019-05-10Paper
A universally-truthful approximation scheme for multi-unit auctions2019-03-29Paper
Primal Beats Dual on Online Packing LPs in the Random-Order Model2018-11-07Paper
Smoothed Analysis of the 2-Opt Algorithm for the General TSP2018-11-05Paper
A packet routing protocol for arbitrary networks2017-12-04Paper
Truthful mechanism design via correlated tree rounding2017-05-15Paper
From static to dynamic routing2016-09-29Paper
How asymmetry helps load balancing2015-11-12Paper
On the impact of combinatorial structure on congestion games2015-11-11Paper
Economical Caching2015-09-24Paper
Computing equilibria for a service provider game with (Im)perfect information2015-09-02Paper
Tight bounds for worst-case equilibria2015-09-02Paper
https://portal.mardi4nfdi.de/entity/Q55012942015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013342015-08-03Paper
Primal beats dual on online packing LPs in the random-order model2015-06-26Paper
Adaptive routing with stale information2015-03-10Paper
Almost optimal permutation routing on hypercubes2015-02-27Paper
https://portal.mardi4nfdi.de/entity/Q29347252014-12-18Paper
Fast convergence to Wardrop equilibria by adaptive sampling methods2014-11-25Paper
Balanced allocations2014-09-26Paper
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control2014-09-18Paper
Online capacity maximization in wireless networks2014-08-18Paper
Oblivious interference scheduling2014-07-23Paper
Thorp Shuffling, Butterflies, and Non-Markovian Couplings2014-07-01Paper
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods2014-07-01Paper
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP2014-03-25Paper
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions2013-09-17Paper
Approximating Wardrop equilibria with finitely many agents2013-07-04Paper
Randomized Mechanisms for Multi-unit Auctions2012-11-01Paper
Online Mechanism Design (Randomized Rounding on the Fly)2012-11-01Paper
Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization2012-11-01Paper
Computing approximate Nash equilibria in network congestion games2012-09-21Paper
https://portal.mardi4nfdi.de/entity/Q53899932012-04-24Paper
Approximation Techniques for Utilitarian Mechanism Design2012-03-15Paper
Improved algorithms for latency minimization in wireless networks2011-06-07Paper
Uncoordinated Two-Sided Matching Markets2011-05-17Paper
Scheduling and Power Assignments in the Physical Model2011-04-05Paper
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods2011-04-04Paper
Selfish Traffic Allocation for Server Farms2010-11-04Paper
Distributed Contention Resolution in Wireless Networks2010-09-10Paper
Approximation techniques for utilitarian mechanism design2010-08-16Paper
Random knapsack in expected polynomial time2010-08-16Paper
Typical properties of winners and losers in discrete optimization2010-08-15Paper
Selfish traffic allocation for server farms2010-08-05Paper
A Unified Approach to Congestion Games and Two-Sided Markets2010-07-09Paper
Who Should Pay for Forwarding Packets?2010-07-09Paper
Economical Caching with Stochastic Prices2009-11-19Paper
Approximability of OFDMA Scheduling2009-10-29Paper
Adaptive routing with stale information2009-08-21Paper
Improved Algorithms for Latency Minimization in Wireless Networks2009-07-14Paper
Management of Variable Data Streams in Networks2009-07-09Paper
Pure Nash equilibria in player-specific and weighted congestion games2009-04-29Paper
https://portal.mardi4nfdi.de/entity/Q35497192009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35247292008-09-12Paper
Approximating Wardrop Equilibria with Finitely Many Agents2008-09-02Paper
Computing Approximate Nash Equilibria in Network Congestion Games2008-07-10Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization2007-11-29Paper
Smoothed Analysis of Integer Programming2007-08-30Paper
Decision-making based on approximate and smoothed Pareto curves2007-07-09Paper
An experimental study of random knapsack problems2007-06-21Paper
On the structure and complexity of worst-case equilibria2007-06-13Paper
Smoothed analysis of integer programming2007-04-19Paper
Algorithms and Computation2006-11-14Paper
Typical Properties of Winners and Losers [0.2ex in Discrete Optimization]2006-06-01Paper
Balanced Allocations: The Heavily Loaded Case2006-06-01Paper
Algorithms – ESA 20042005-08-18Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q48289622004-11-29Paper
Random knapsack in expected polynomial time2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q30464842004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48131342004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47372182004-08-11Paper
Randomized Pursuit-Evasion in Graphs2004-06-18Paper
Tail Bounds and Expectations for Random Arc Allocation and Applications2004-06-18Paper
https://portal.mardi4nfdi.de/entity/Q45425562004-01-27Paper
https://portal.mardi4nfdi.de/entity/Q44063752004-01-03Paper
https://portal.mardi4nfdi.de/entity/Q45369002002-11-06Paper
Data management in networks: Experimental evaluation of a provably good strategy2002-06-27Paper
Improved routing and sorting on multibutterflies2001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q45270192001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q45112392000-10-30Paper
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols2000-10-18Paper
https://portal.mardi4nfdi.de/entity/Q49526492000-05-10Paper
Shortest-Path Routing in Arbitrary Networks2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q38366031999-12-08Paper
https://portal.mardi4nfdi.de/entity/Q42284891999-10-04Paper
Universal continuous routing strategies1998-09-27Paper

Research outcomes over time

This page was built for person: Berthold Vöcking