scientific article; zbMATH DE number 7053386

MaRDI QIDQ5743510zbMATH OpenFDO

Authors

Publication date 10 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=2095250

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)

Recommendations

• A stochastic algorithm for online bipartite resource allocation problems
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• Asymptotically optimal algorithms for budgeted multiple play bandits
• The online stochastic generalized assignment problem
• Stochastic Averaging for Constrained Optimization With Application to Online Resource Allocation
• Approximation in Preemptive Stochastic Online Scheduling
• Competitive online algorithms for resource allocation over the positive semidefinite cone
• Randomized approximation and online algorithms for assignment problems
• Approximation algorithms for stochastic online matching with reusable resources
• Approximation algorithms for a generalization of the maximum budget allocation

Cites work

• A dynamic near-optimal algorithm for online linear programming
• AdWords and generalized online matching
• Fractional Matching Via Balls-and-Bins
• scientific article; zbMATH DE number 432824 (Why is no real title available?)
• Improved Bounds for Online Stochastic Matching
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• Online Advertisement, Optimization and Stochastic Networks
• Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
• Online bipartite matching with unknown distributions
• Online Optimization with Uncertain Information
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• Online Stochastic Matching: Beating 1-1/e
• Online stochastic matching: new algorithms with better bounds
• Online stochastic packing applied to display ad allocation
• Online stochastic weighted matching: improved approximation algorithms
• Optimal oblivious routing in polynomial time
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Robust linear optimization under general norms.
• Robust optimization-methodology and applications

Cited in

(15)

• Improved online algorithms for knapsack and GAP in the random order model
• Bicriteria online matching: maximizing weight and cardinality
• A stochastic algorithm for online bipartite resource allocation problems
• Online submodular welfare maximization: greedy beats 1/2 in random order
• Online resource allocation under partially predictable demand
• Multiplicative Pacing Equilibria in Auction Markets
• Semi-online bipartite matching
• Stochastic online metric matching
• Improved Online Algorithms for Knapsack and GAP in the Random Order Model
• scientific article; zbMATH DE number 7758362 (Why is no real title available?)
• Online allocation and display ads optimization with surplus supply
• Online ad allocation in bounded-degree graphs
• Edge-weighted online bipartite matching
• Adwords in a panorama
• Knapsack secretary with bursty adversary

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743510)