Sciweavers

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

25

ESA
2010
Springer

favoriteEmaildiscussreport

152views Algorithms» more ESA 2010»

Improved Bounds for Online Stochastic Matching

13 years 12 months ago

Improved Bounds for Online Stochastic Matching

Download www.stanford.edu

Bahman Bahmani, Michael Kapralov

Real-time Traffic

Algorithms | ESA 2010 |

claim paper

Related Content

» When LP is the Cure for Your Matching Woes Improved Bounds for Stochastic Matchings

» Stochastic Online Scheduling on Parallel Machines

» Improved Rates for the Stochastic ContinuumArmed Bandit Problem

» Online PrimalDual Algorithms for Maximizing AdAuctions Revenue

» A NearTight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry

» Approximation in Preemptive Stochastic Online Scheduling

» Online Least Squares Estimation with SelfNormalized Processes An Application to Bandit Pro...

» Simultaneous approximations for adversarial and stochastic online budgeted allocation

» On Dynamic Bin Packing An Improved Lower Bound and Resource Augmentation Analysis

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2010
Where	ESA
Authors	Bahman Bahmani, Michael Kapralov

Comments (0)