Jan-Philipp W. Kappmeier

Learn More
Flows over time [4] generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge capacities. In this paper, we extend this concept of a dynamic optimization problem to the more general setting of(More)
In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the k-means problem, this has led to the development of several (1 + ε)-approximations (under the assumption that k is a constant), but also to the design of algorithms that are extremely fast in(More)
  • 1