Jochen Könemann
1998–2006
A researcher in the Science corpus: 2 papers; trusts 4 researchers and is trusted by 2 researchers here, as inferred from the citation graph.
Whom Jochen Könemann trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Jochen Könemann overall
- Sanjeev Arora
- Jacob Bien
- Harald Räcke
- Robert Tibshirani
- Ashwinkumar Badanidiyuru
- Satyen Kale
- Hong Chang
- Paul Christiano
- Elad Hazan
Papers from Jochen Könemann's perspective
Ordered by how strongly the researchers Jochen Könemann trusts endorse each paper. Same corpus, a different order for every researcher.
- A threshold of ln n for approximating set cover (preliminary version)
- On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
- Algorithms for facility location problems with outliers (ACM-SIAM Symposium on Discrete Algorithms)
- Minimizing Congestion in General Networks (IEEE Annual Symposium on Foundations of Computer Science)
- Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation (JACM)
- The geometry of graphs and some of its algorithmic applications
- Some optimal inapproximability results
- Primal-dual approximation algorithms for metric facility location and k-median problems
- Approximation algorithms for facility location problems
- Probabilistic checking of proofs: a new characterization of NP