MohammadHossein Bateni
Computational Theory and Mathematics · 2010
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 9 citations into it
Whom MohammadHossein Bateni trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts MohammadHossein Bateni overall
Papers from MohammadHossein Bateni's perspective
Ordered by how strongly the researchers MohammadHossein Bateni trusts endorse each paper. Same corpus, a different order for every researcher.
- Some optimal inapproximability results
- Submodular functions and convexity
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
- A note on maximizing a submodular set function subject to a knapsack constraint (Operations Research Letters)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
- Optimal approximation for the submodular welfare problem in the value oracle model (Symposium on the Theory of Computing)
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
Their papers
- Submodular secretary problem and extensions (2010) — 173 citations