scientific article

Publication date: 6 August 2010

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

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)

Related Items (56)

Minimum Cost Perfect Matching with Delays for Two Sources ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Minimum cost perfect matching with delays for two sources ⋮ Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Online Allocation and Pricing with Economies of Scale ⋮ Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ A stochastic algorithm for online bipartite resource allocation problems ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ Online Stochastic Matching: Online Actions Based on Offline Statistics ⋮ Multiplicative Pacing Equilibria in Auction Markets ⋮ A Dynamic Near-Optimal Algorithm for Online Linear Programming ⋮ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order ⋮ Greedy Matching in Bipartite Random Graphs ⋮ Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming ⋮ Near optimal algorithms for online weighted bipartite matching in adversary model ⋮ Advertisement allocation for generalized second-pricing schemes ⋮ An Experimental Study of Algorithms for Online Bipartite Matching ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ Online stochastic weighted matching algorithm for real‐time shared parking ⋮ Social welfare and profit maximization from revealed preferences ⋮ Dynamic Stochastic Matching Under Limited Time ⋮ Dynamic Relaxations for Online Bipartite Matching ⋮ On-line maximum matching in complete multi-partite graphs with an application to optical networks ⋮ Two-stage submodular maximization under knapsack and matroid constraints ⋮ Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching ⋮ Max-min greedy matching problem: hardness for the adversary and fractional variant ⋮ Markovian online matching algorithms on large bipartite random graphs ⋮ Relative Worst-Order Analysis: A Survey ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising ⋮ On Matching and Thickness in Heterogeneous Dynamic Markets ⋮ Tighter Bounds for Online Bipartite Matching ⋮ Online Maximum Matching with Recourse ⋮ Scheduling In the random-order model ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Online algorithms for maximum cardinality matching with edge arrivals ⋮ Greedy Bipartite Matching in Random Type Poisson Arrival Model ⋮ Permutation Strikes Back: The Power of Recourse in Online Metric Matching ⋮ Stable secretaries ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ A polyhedral approach to online bipartite matching ⋮ Greedy metric minimum online matchings with random arrivals ⋮ Online submodular maximization: beating 1/2 made simple ⋮ Online Vertex-Weighted Bipartite Matching ⋮ Social Welfare in One-Sided Matching Markets without Money ⋮ Impatient Online Matching ⋮ Stochastic Online Metric Matching ⋮ How the Experts Algorithm Can Help Solve LPs Online ⋮ On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology ⋮ Online Algorithms for Maximum Cardinality Matching with Edge Arrivals ⋮ Online Stochastic Matching: New Algorithms with Better Bounds ⋮ Learn from history for online bipartite matching

This page was built for publication: