Pages that link to "Item:Q3636884"
From MaRDI portal
The following pages link to The Design of Competitive Online Algorithms via a Primal—Dual Approach (Q3636884):
Displaying 35 items.
- How to allocate goods in an online market? (Q262246) (← links)
- Advertisement allocation for generalized second-pricing schemes (Q614045) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Competitive online algorithms for resource allocation over the positive semidefinite cone (Q1650777) (← links)
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
- Primal-dual analysis for online interval scheduling problems (Q2182859) (← links)
- Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations (Q2345465) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Unified Algorithms for Online Learning and Competitive Analysis (Q2806821) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations (Q2868635) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (Q3448775) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- Online Resource Allocation Under Partially Predictable Demand (Q5003724) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- (Q5075787) (← links)
- Game efficiency through linear programming duality (Q5090446) (← links)
- (Q5111737) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals (Q5130511) (← links)
- (Q5136326) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)
- Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5918418) (← links)
- Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5925636) (← links)
- (Q6087217) (← links)