Antoine Désir

2015

A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Whom Antoine Désir trusts overall

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

  1. George L. Nemhauser
  2. Gruia Calinescu
  3. Laurence A. Wolsey
  4. Chandra Chekuri
  5. Martin Pál

Papers from Antoine Désir's perspective

Ordered by how strongly the researchers Antoine Désir trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (SIAM journal on computing (Print))
  2. Best Algorithms for Approximating the Maximum of a Submodular Set Function
  3. A threshold of ln n for approximating set cover (preliminary version)
  4. Maximizing Non-Monotone Submodular Functions
  5. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (SIAM journal on computing (Print))
  6. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
  7. An analysis of approximations for maximizing submodular set functions—I
  8. Non-monotone submodular maximization under matroid and knapsack constraints
  9. On maximizing welfare when utility functions are subadditive (Symposium on the Theory of Computing)
  10. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

Their papers