Vineet Goyal
ACM Conference on Economics and Computation · 2013–2015
A researcher in the Science corpus: 2 papers; trusts 6 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Vineet Goyal trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Vineet Goyal's perspective
Ordered by how strongly the researchers Vineet Goyal trusts endorse each paper. Same corpus, a different order for every researcher.
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (SIAM journal on computing (Print))
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Conditional logit analysis of qualitative choice behavior
- A threshold of ln n for approximating set cover (preliminary version)
- Maximizing Non-Monotone Submodular Functions
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (SIAM journal on computing (Print))
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
- An analysis of approximations for maximizing submodular set functions—I
- Non-monotone submodular maximization under matroid and knapsack constraints
- On maximizing welfare when utility functions are subadditive (Symposium on the Theory of Computing)
Their papers
- ( Please , provide the manuscript number ! ) Capacity Constrained Assortment Optimization under the Markov Chain based Choice Model (2015) — 57 citations
- A markov chain approximation to choice modeling (2013) — 315 citations