scientific article; zbMATH DE number 7053386

zbMath1422.68324MaRDI QIDQ5743510

No author found.

Publication date: 10 May 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (10)

Multiplicative Pacing Equilibria in Auction Markets ⋮ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order ⋮ Bicriteria Online Matching: Maximizing Weight and Cardinality ⋮ Online allocation and display ads optimization with surplus supply ⋮ Unnamed Item ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Unnamed Item ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Stochastic Online Metric Matching ⋮ Online Resource Allocation Under Partially Predictable Demand

Cites Work

• Unnamed Item
• Robust linear optimization under general norms.
• Robust optimization-methodology and applications
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Online Stochastic Weighted Matching: Improved Approximation Algorithms
• Online Optimization with Uncertain Information
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• AdWords and generalized online matching
• Improved Bounds for Online Stochastic Matching
• Online Stochastic Packing Applied to Display Ad Allocation
• Fractional Matching Via Balls-and-Bins
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
• Online Stochastic Matching: Beating 1-1/e
• Online Stochastic Matching: New Algorithms with Better Bounds
• Online Advertisement, Optimization and Stochastic Networks
• Online bipartite matching with unknown distributions
• Online bipartite matching with random arrivals
• Optimal oblivious routing in polynomial time

This page was built for publication: