<--- Back to Details
First PageDocument Content
Matroid theory / Operations research / Computational complexity theory / Submodular set function / Matroid / Linear programming / Combinatorial optimization / Algorithm / Approximation algorithm / Mathematics / Applied mathematics / Theoretical computer science
Date: 2012-08-23 13:02:17
Matroid theory
Operations research
Computational complexity theory
Submodular set function
Matroid
Linear programming
Combinatorial optimization
Algorithm
Approximation algorithm
Mathematics
Applied mathematics
Theoretical computer science

Submodular Functions: Learnability, Structure, and Optimization∗ Maria-Florina Balcan†

Add to Reading List

Source URL: www.cc.gatech.edu

Download Document from Source Website

File Size: 722,39 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

Mathematics / Mathematical optimization / Computational complexity theory / Combinatorial optimization / Travelling salesman problem / Cutting-plane method / Decomposition method / Linear programming / COIN-OR / Ear decomposition

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document