• Publications
  • Influence
Random knapsack in expected polynomial time
TLDR
We prove, for various input distributions, that the number of dominating solutions (i.e., Pareto-optimal knapsack fillings) to this problem is polynomially bounded in number of available items. Expand
  • 118
  • 12
  • PDF
Typical properties of winners and losers in discrete optimization
TLDR
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e. Expand
  • 72
  • 9
  • PDF
Smoothed Analysis of Three Combinatorial Problems
TLDR
We study the smoothed complexity of three classical discrete problems: quicksort, left-to-right maxima counting and shortest paths. Expand
  • 55
  • 9
Typical Properties of Winners and Losers in Discrete Optimization
TLDR
We present a probabilistic analysis of a large class of combinatorial optimization problems containing all binary optimization problems defined by linear constraints and a linear objective function over $\{0,1\}^n$. Expand
  • 47
  • 5
A powerful heuristic for telephone gossiping
TLDR
A refined heuristic for computing schedules for gossiping in the telephone model is presented. Expand
  • 42
  • 4
  • PDF
Computing equilibria for congestion games with (im)perfect information
TLDR
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Expand
  • 22
  • 2
  • PDF
Probabilistic analysis of knapsack core algorithms
TLDR
We study the average-case performance of algorithms for the binary knapsack problem. Expand
  • 22
  • 1
  • PDF
The Knapsack Problem
TLDR
An algorithm for solving a classic optimization problem – how best to pack a knapsack for hike, taking into account the weight and the associated profit of each object carried. Expand
  • 3
  • 1
  • PDF
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
TLDR
A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach. Expand
  • 39
  • PDF
Random knapsack in expected polynomial time
TLDR
We present the first average-case analysis proving a polynomial upper bound on the expected running time of an exact algorithm for the 0/1 knapsack problem. Expand
  • 21
...
1
2
...