Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

STOC
2007
ACM

favoriteEmaildiscussreport

120views Algorithms» more STOC 2007»

Approximation algorithms for budgeted learning problems

14 years 11 months ago

Approximation algorithms for budgeted learning problems

Download snowbird.djvuzone.org

Sudipto Guha, Kamesh Munagala

Real-time Traffic

Algorithms | Approximation Algorithms | STOC 2007 |

claim paper

Related Content

» The Budgeted Multiarmed Bandit Problem

» Maximum Coverage Problem with Group Budget Constraints and Applications

» The finite horizon investor problem with a budget constraint

» BanditBased Algorithms for Budgeted Learning

» Fast heuristics for the Steiner tree problem with revenues budget and hop constraints

» Simultaneous approximations for adversarial and stochastic online budgeted allocation

» On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular We...

» Iterative Rounding for MultiObjective Optimization Problems

» Bicriteria Network Design via Iterative Rounding

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Sudipto Guha, Kamesh Munagala

Comments (0)