Harald Räcke

Suggest Changes
Satish Rao27
Frank Thomson Leighton23
Baruch Awerbuch21
Joseph Naor19
Yuval Rabani19
21Mohammad Taghi Hajiaghayi
18Anupam Gupta
17Frank Thomson Leighton
15Rohit Khandekar
15Rob Van Stee

Filter Results:

  • Full text PDF available (41)

Publication Year

1994
2017
  • This year (2)
  • Last 5 years (12)
  • Last 10 years (23)

Publication Type

Co-author

Journals and Conferences

Key Phrases

Learn More
Optimal hierarchical decompositions for congestion minimization in networks
Hierarchical graph decompositions play an important role in the design of approximation and online algorithms for graph problems. This is mainly due to the fact that the results concerning the approximation of metric spaces by tree metrics (e.g. [10,11,14,16]) depend on hierarchical graph decompositions. In this line of work a probability distribution over… (More)
Balanced Graph Partitioning
In this paper we consider the problem of (<i>k</i>, <i>&#965;</i>)-balanced graph partitioning - dividing the vertices of a graph into <i>k</i> almost equal size components (each of size less than <i>&#965;</i> &#8226; <i>n</i>&lt;over&gt;<i>k</i>) so that the capacity of edges between different components is minimized. This problem is a natural… (More)
Minimizing Congestion in General Networks
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performance of distributed applications. In this paper we introduce a framework for solving on-line problems that aim to minimize the congestion (i.e. the maximum load of a network link) in… (More)
Optimal oblivious routing in polynomial time
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is not polynomial time. We give a polynomial time construction that guarantee's Racke's bounds, and more generally gives the true optimal ratio for any network.
Randomized Pursuit-Evasion in Graphs
We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node… (More)
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routing) based on Wardrop's model focus mostly on the static analysis of equilibria. In this paper, we ask the question whether the population of agents responsible for routing the… (More)
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
In this article, we study metrics of <i>negative type</i>, which are metrics (<i>V</i>, d) such that &sqrt;d is an Euclidean metric; these metrics are thus also known as &ell;<sub>2</sub>-squared metrics. We show how to embed <i>n</i>-point negative-type metrics into Euclidean space &ell;<sub>2</sub> with distortion <i>D</i> &equals;… (More)
Almost tight bounds for reordering buffer management
We give almost tight bounds for the online reordering buffer management problem on the uniform metric. Specifically, we present the first non-trivial lower bounds for this problem by showing that deterministic online algorithms have a competitive ratio of at least &#937;(&#8730;{log k/log log k}) and randomized online algorithms have a competitive ratio of… (More)