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