Rico Zenklusen
Computational Theory and Mathematics · 2011
A researcher in the Science corpus: 1 paper; trusts 10 researchers and is trusted by 6 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 7 citations into it; #4,973 of 12,182 by trust here, #8,294 by citations
Whom Rico Zenklusen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Rico Zenklusen overall
Papers from Rico Zenklusen's perspective
Ordered by how strongly the researchers Rico Zenklusen trusts endorse each paper. Same corpus, a different order for every researcher.
- An analysis of approximations for maximizing submodular set functions—I
- A threshold of ln n for approximating set cover (preliminary version)
- Submodular functions and convexity
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
- Submodular maximization by simulated annealing
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- The Probabilistic Method
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (SIAM journal on computing (Print))
- A note on maximizing a submodular set function subject to a knapsack constraint (Operations Research Letters)
- Multi-parameter mechanism design and sequential posted pricing (Behavioral and Quantitative Game Theory)