Tight approximation algorithms for ordered covering

DOI10.1007/978-3-031-38906-1_9OpenAlexW4385317342MaRDI QIDQ6179404

Agastya Vibhuti Jha, Syamantak Das, Jatin Batra

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_9

zbMATH Keywords

schedulingapproximation algorithmsrandomized algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating min sum set cover
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• The ordered \(k\)-median problem: surrogate models and approximation algorithms
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• Minimum Latency Submodular Cover
• A threshold of ln n for approximating set cover
• All-Norms and All-L_p-Norms Approximation Algorithms
• Dependent rounding and its applications to approximation algorithms
• Simpler and Better Algorithms for Minimum-Norm Load Balancing
• Approximation algorithms for minimum norm and ordered optimization problems
• Constant-factor approximation for ordered k-median

This page was built for publication: Tight approximation algorithms for ordered covering