scientific article; zbMATH DE number 7765403

DOI10.4230/lipics.isaac.2020.45arXiv1708.04903MaRDI QIDQ6087217

Nguyen Kim Thang

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/1708.04903

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

smoothnessprimal-dualconfiguration linear programs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Competitive algorithms for demand response management in a smart grid

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
• Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
• Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
• Intrinsic Robustness of the Price of Anarchy
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• Online Contention Resolution Schemes
• Solving Optimization Problems with Diseconomies of Scale via Decoupling
• Online Covering with Sum of $ell_q$-Norm Objectives.
• Competitive algorithms from competitive equilibria
• Welfare Maximization with Production Costs: A Primal Dual Approach
• Online Submodular Maximization with Preemption
• Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
• Online matching with concave returns
• Welfare and Profit Maximization with Production Costs
• A Unified Continuous Greedy Algorithm for Submodular Maximization

This page was built for publication: