Online covering with \(\ell_q\)-norm objectives and applications to network design
From MaRDI portal
Publication:2205975
DOI10.1007/s10107-019-01409-9zbMath1451.90125OpenAlexW2951981625MaRDI QIDQ2205975
Xiangkun Shen, Viswanath Nagarajan
Publication date: 21 October 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-019-01409-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved approximation scheme for the Group Steiner Problem
- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
- Randomized Competitive Algorithms for Generalized Caching
- A general approach to online network optimization problems
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
- Online Primal-Dual Algorithms for Covering and Packing
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- The Online Set Cover Problem
- On non-uniform multicommodity buy-at-bulk network design
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Online Buy-at-Bulk Network Design
- Online Semidefinite Programming.
- Online Covering with Sum of $ell_q$-Norm Objectives.
- Approximating Sparse Covering Integer Programs Online
- Welfare Maximization with Production Costs: A Primal Dual Approach
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
- Online matching with concave returns
- Welfare and Profit Maximization with Production Costs
- Online Mixed Packing and Covering
This page was built for publication: Online covering with \(\ell_q\)-norm objectives and applications to network design
