Pages that link to "Item:Q3169034"
From MaRDI portal
The following pages link to Online Primal-Dual Algorithms for Covering and Packing (Q3169034):
Displaying 49 items.
- How to allocate goods in an online market? (Q262246) (← links)
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- A dynamic learning algorithm for online matching problems with concave returns (Q319996) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- Frequency capping in online advertising (Q490332) (← links)
- Competitive online algorithms for resource allocation over the positive semidefinite cone (Q1650777) (← links)
- Online set multicover algorithms for dynamic D2D communications (Q1679520) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Online constrained optimization with recourse (Q1943619) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Online packet-routing in grids with bounded buffers (Q2408091) (← links)
- Online maximum \(k\)-interval coverage problem (Q2692231) (← links)
- The multiplicative weights update method: a meta-algorithm and applications (Q2913806) (← links)
- Model predictive control for dynamic resource allocation (Q2925344) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Online Set Packing (Q3143291) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- (Q4352314) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- (Q4629365) (← links)
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets (Q5000650) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Online Covering with Sum of $ell_q$-Norm Objectives. (Q5111341) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms (Q5384045) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Online unit covering in Euclidean space (Q5919348) (← links)
- On-line path computation and function placement in SDNs (Q5920222) (← links)
- (Q6087217) (← links)
- Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)
- A truthful near-optimal mechanism for online linear packing-covering problem in the random order model (Q6543267) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
- Online multiset submodular cover (Q6582377) (← links)
- Delaying decisions and reservation costs (Q6591489) (← links)
- Online Nash welfare maximization without predictions (Q6609160) (← links)