Back to Results
First PageMeta Content
Approximation algorithms / Submodular set function / Time complexity / Linear programming relaxation / Polynomial-time approximation scheme / Linear programming / Randomized rounding / Normal distribution / Linear regression / Theoretical computer science / Applied mathematics / Computational complexity theory


Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure
Add to Reading List

Document Date: 2015-01-22 00:44:30

Open Document

File Size: 417,61 KB

Share Result on Facebook

Company

Microsoft / /

/

Facility

S. Muthukrishnan Rutgers University / /

IndustryTerm

ε-accurate algorithm / integral solutions / polynomial-time algorithms / fractional solution / constant approximation algorithm / poly-time algorithm / Internet / greedy algorithm / integral solution / approximation algorithms / using traditional approximation algorithms / /

Organization

Ecole Normale Sup´erieure / Rutgers University / /

Person

Chen / Thibaut Horel / Dc / /

Position

Archer / General / Singer / auctioneer / /

Technology

greedy algorithm / approximation algorithms / constant approximation algorithm / following algorithm / machine learning / poly-time algorithm / polynomial-time algorithms / 8 Algorithm / /

SocialTag