Jon Lee

Computational Theory and Mathematics · 2009

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

Subfields

Whom Jon Lee trusts overall

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

  1. Jan Vondr'ak
  2. Mohit Tawarmalani
  3. Michel X. Goemans
  4. Nikolaos V. Sahinidis
  5. Maxim Sviridenko
  6. Uriel Feige
  7. David P. Williamson
  8. Alexander Schrijver
  9. L. Lov'asz
  10. J. Håstad

Who trusts Jon Lee overall

  1. Himabindu Lakkaraju
  2. Alex Kulesza
  3. Hui-Ching Lin
  4. Shayan Oveis Gharan
  5. Ruth Misener
  6. Jan Vondr'ak
  7. Moran Feldman
  8. Gruia Calinescu
  9. Ece Kamar
  10. Pietro Belotti

Papers from Jon Lee's perspective

Ordered by how strongly the researchers Jon Lee trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  2. A threshold of ln n for approximating set cover (preliminary version)
  3. An analysis of approximations for maximizing submodular set functions—I
  4. Submodular functions and convexity
  5. Some optimal inapproximability results
  6. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  7. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
  8. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
  9. An Exact Algorithm for Maximum Entropy Sampling
  10. Near-optimal sensor placements in Gaussian processes

Their papers