Harald Räcke

IEEE Annual Symposium on Foundations of Computer Science · 2002–2008

A researcher in the Science corpus: 2 papers; trusts 5 researchers and is trusted by 9 researchers here, as inferred from the citation graph.

Whom Harald Räcke trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Naveen Garg
  2. David L. Applegate
  3. Serge A. Plotkin
  4. Jittat Fakcharoenphol
  5. Jochen Könemann
  6. Edith Cohen
  7. Satish Rao
  8. David B. Shmoys
  9. É. Tardos
  10. Kunal Talwar

Who trusts Harald Räcke overall

  1. Jochen Könemann
  2. Jonathan A. Kelner
  3. Ojas D. Parekh
  4. David L. Applegate
  5. D. Segev
  6. Yin Tat Lee
  7. Lorenzo Orecchia

Papers from Harald Räcke's perspective

Ordered by how strongly the researchers Harald Räcke trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The geometry of graphs and some of its algorithmic applications
  2. Minimizing Congestion in General Networks (IEEE Annual Symposium on Foundations of Computer Science)
  3. Optimal oblivious routing in polynomial time
  4. A tight bound on approximating arbitrary metrics by tree metrics (Symposium on the Theory of Computing)
  5. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
  6. Fast approximation algorithms for fractional packing and covering problems
  7. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
  8. Probabilistic approximation of metric spaces and its algorithmic applications
  9. Randomized rounding: A technique for provably good algorithms and algorithmic proofs
  10. Primal-dual approximation algorithms for metric facility location and k-median problems

Their papers