The Design of Competitive Online Algorithms via a Primal—Dual Approach
From MaRDI portal
Recommendations
Cited in
(52)- Dynamic algorithms via the primal-dual method
- Competitive online algorithms for resource allocation over the positive semidefinite cone
- A primal-dual online algorithm for the k-server problem on weighted HSTs
- Primal-dual analysis for online interval scheduling problems
- Dynamic clustering to minimize the sum of radii
- Online covering with \(\ell_q\)-norm objectives and applications to network design
- Welfare maximization with production costs: a primal dual approach
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- How to allocate goods in an online market?
- Unified algorithms for online learning and competitive analysis
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
- A dynamic near-optimal algorithm for online linear programming
- Online primal-dual algorithms for covering and packing
- On the randomized competitive ratio of reordering buffer management with non-uniform costs
- Design of dynamic algorithms via primal-dual method
- On randomized algorithms for matching in the online preemptive model
- The power of deferral: maintaining a constant-competitive Steiner tree online
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Online resource allocation under partially predictable demand
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
- Online disjoint set cover without prior knowledge
- Game efficiency through linear programming duality
- Dynamic clustering to minimize the sum of radii
- Online Algorithms for Multilevel Aggregation
- An approximation algorithm for network revenue management under nonstationary arrivals
- Network construction with ordered constraints
- Approximating sparse covering integer programs online
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
- Algorithms – ESA 2004
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- Almost Tight Bounds for Reordering Buffer Management
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- scientific article; zbMATH DE number 7765403 (Why is no real title available?)
- Advertisement allocation for generalized second-pricing schemes
- Adversarial bandits with knapsacks
- The online min-sum set cover problem
- Real-time peak-demand minimization with energy storage using competitive ratio
- Distributional online weighted paging with limited horizon
- Online metric allocation and time-varying regularization
- Primal-dual algorithms with predictions for online bounded allocation and ad-auctions problems
- Competitive data-structure dynamization
- A nearly optimal deterministic online algorithm for non-metric facility location
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- Edge arrival online matching: the power of free disposal on acyclic graphs
- From offline to online: sequentially distributing points on a sphere
- Optimal competitive ratio for optimization problems with congestion effects
- Online multiple resource allocation problems with departures via the primal-dual approach
- Optimal online bipartite matching in degree-2 graphs
- Time-optimal k-server
- Coupled and \(k\)-sided placements: generalizing generalized assignment
This page was built for publication: The Design of Competitive Online Algorithms via a Primal—Dual Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636884)
