Document Open Access Logo

New Results on a General Class of Minimum Norm Optimization Problems

Authors Kuowen Chen , Jian Li, Yuval Rabani, Yiran Zhang

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.50.pdf
  • Filesize: 1.01 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Approximation algorithms
  • Mathematics of computing → Combinatorial optimization
  • Mathematics of computing → Linear programming
Keywords
  • Approximation Algorithms
  • Minimum Norm Optimization
  • Linear Programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We study the general norm optimization for combinatorial problems, initiated by Chakrabarty and Swamy (STOC 2019). We propose a general formulation that captures a large class of combinatorial structures: we are given a set 𝒰 of n weighted elements and a family of feasible subsets ℱ. Each subset S ∈ ℱ is called a feasible solution/set of the problem. We denote the value vector by v = {v_i}_{i ∈ [n]}, where v_i ≥ 0 is the value of element i. For any subset S ⊆ 𝒰, we use v[S] to denote the n-dimensional vector {v_e⋅ 𝟏[e ∈ S]}_{e ∈ 𝒰} (i.e., we zero out all entries that are not in S). Let f: ℝⁿ → ℝ_+ be a symmetric monotone norm function. Our goal is to minimize the norm objective f(v[S]) over feasible subset S ∈ ℱ. The problem significantly generalizes the corresponding min-sum and min-max problems.
We present a general equivalent reduction of the norm minimization problem to a multi-criteria optimization problem with logarithmic budget constraints, up to a constant approximation factor. Leveraging this reduction, we obtain constant factor approximation algorithms for the norm minimization versions of several covering problems, such as interval cover, multi-dimensional knapsack cover, and logarithmic factor approximation for set cover. We also study the norm minimization versions for perfect matching, s-t path and s-t cut. We show the natural linear programming relaxations for these problems have a large integrality gap. To complement the negative result, we show that, for perfect matching, it is possible to obtain a bi-criteria result: for any constant ε,δ > 0, we can find in polynomial time a nearly perfect matching (i.e., a matching that matches at least 1-ε proportion of vertices) and its cost is at most (8+δ) times of the optimum for perfect matching. Moreover, we establish the existence of a polynomial-time O(log log n)-approximation algorithm for the norm minimization variant of the s-t path problem. Specifically, our algorithm achieves an α-approximation with a time complexity of n^{O(log log n / α)}, where 9 ≤ α ≤ log log n.

Cite As Get BibTex

Kuowen Chen, Jian Li, Yuval Rabani, and Yiran Zhang. New Results on a General Class of Minimum Norm Optimization Problems. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 50:1-50:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.50

Author Details

Kuowen Chen
  • Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
Jian Li
  • Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
Yuval Rabani
  • Computer Science and Engineering, The Hebrew University of Jerusalem, Israel
Yiran Zhang
  • Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China

References

  1. Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, and Joachim Spoerhase. Parameterized approximation schemes for clustering with general norm objectives. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 1377-1399. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00085.
  2. Ali Aouad and Danny Segev. The ordered k-median problem: surrogate models and approximation algorithms. Math. Program., 177(1-2):55-83, 2019. URL: https://doi.org/10.1007/S10107-018-1259-3.
  3. Nikhil Ayyadevara, Nikhil Bansal, and Milind Prabhu. On minimizing generalized makespan on unrelated machines. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 21, 2023. Google Scholar
  4. Yossi Azar and Amir Epstein. Convex programming for scheduling unrelated parallel machines. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 331-337, 2005. URL: https://doi.org/10.1145/1060590.1060639.
  5. Jatin Batra, Syamantak Das, and Agastya Vibhuti Jha. Tight approximation algorithms for ordered covering. In Algorithms and Data Structures Symposium, pages 120-135. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-38906-1_9.
  6. André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, and Guido Schäfer. Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming, 128:355-372, 2011. URL: https://doi.org/10.1007/S10107-009-0307-4.
  7. Vladimir Braverman, Shaofeng H-C Jiang, Robert Krauthgamer, and Xuan Wu. Coresets for ordered weighted clustering. In International Conference on Machine Learning, pages 744-753. PMLR, 2019. URL: http://proceedings.mlr.press/v97/braverman19a.html.
  8. Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. Submodular maximization with cardinality constraints. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1433-1452. SIAM, 2014. URL: https://doi.org/10.1137/1.9781611973402.106.
  9. Jaroslaw Byrka, Krzysztof Sornat, and Joachim Spoerhase. Constant-factor approximation for ordered k-median. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 620-631, 2018. URL: https://doi.org/10.1145/3188745.3188930.
  10. Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a submodular set function subject to a matroid constraint. In International Conference on Integer Programming and Combinatorial Optimization, pages 182-196. Springer, 2007. Google Scholar
  11. Paolo M. Camerini, Giulia Galbiati, and Francesco Maffioli. Random pseudo-polynomial algorithms for exact matroid problems. Journal of Algorithms, 13(2):258-273, 1992. URL: https://doi.org/10.1016/0196-6774(92)90018-8.
  12. Deeparnab Chakrabarty and Chaitanya Swamy. Interpolating between k-median and k-center: Approximation algorithms for ordered k-median. In 45th International Colloquium on Automata, Languages, and Programming, volume 107 of LIPIcs, pages 29:1-29:14, 2018. URL: https://doi.org/10.4230/LIPICS.ICALP.2018.29.
  13. Deeparnab Chakrabarty and Chaitanya Swamy. Approximation algorithms for minimum norm and ordered optimization problems. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 126-137, 2019. URL: https://doi.org/10.1145/3313276.3316322.
  14. Deeparnab Chakrabarty and Chaitanya Swamy. Simpler and better algorithms for minimum-norm load balancing. In 27th Annual European Symposium on Algorithms, volume 144 of LIPIcs, pages 27:1-27:12, 2019. URL: https://doi.org/10.4230/LIPICS.ESA.2019.27.
  15. Chandra Chekuri and Alina Ene. Submodular cost allocation problem and applications. In Automata, Languages and Programming - 38th International Colloquium, volume 6755 of Lecture Notes in Computer Science, pages 354-366, 2011. URL: https://doi.org/10.1007/978-3-642-22006-7_30.
  16. Chandra Chekuri, Jan Vondrák, and Rico Zenklusen. Multi-budgeted matchings and matroid intersection via dependent rounding. In Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms, pages 1080-1097. SIAM, 2011. URL: https://doi.org/10.1137/1.9781611973082.82.
  17. Kuowen Chen, Jian Li, Yuval Rabani, and Yiran Zhang. New results on a general class of minimum norm optimization problems, 2025. URL: https://arxiv.org/abs/2504.13489.
  18. Eden Chlamtáč, Yury Makarychev, and Ali Vakilian. Approximating fair clustering with cascaded norm objectives. In Proceedings of the 2022 annual ACM-SIAM symposium on discrete algorithms (SODA), pages 2664-2683. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.104.
  19. Shichuan Deng, Jian Li, and Yuval Rabani. Generalized unrelated machine scheduling problem. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 2898-2916. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH110.
  20. Shichuan Deng and Qianfan Zhang. Ordered k-median with outliers. In Amit Chakrabarti and Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference), volume 245 of LIPIcs, pages 34:1-34:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.34.
  21. Irit Dinur and David Steurer. Analytical approach to parallel repetition. In Symposium on Theory of Computing, pages 624-633, 2014. URL: https://doi.org/10.1145/2591796.2591884.
  22. Nicolas El Maalouly. Exact matching: Algorithms and related problems. In 40th International Symposium on Theoretical Aspects of Computer Science, 2023. Google Scholar
  23. Uriel Feige. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634-652, 1998. URL: https://doi.org/10.1145/285055.285059.
  24. Daniel Golovin, Anupam Gupta, Amit Kumar, and Kanat Tangwongsan. All-norms and all-l_p-norms approximation algorithms. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2008). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2008. Google Scholar
  25. Fabrizio Grandoni, R. Ravi, Mohit Singh, and Rico Zenklusen. New approaches to multi-objective optimization. Math. Program., 146(1-2):525-554, 2014. URL: https://doi.org/10.1007/S10107-013-0703-7.
  26. Fabrizio Grandoni, Ramamoorthi Ravi, and Mohit Singh. Iterative rounding for multi-objective optimization problems. In European Symposium on Algorithms, pages 95-106. Springer, 2009. Google Scholar
  27. Fabrizio Grandoni and Rico Zenklusen. Approximation schemes for multi-budgeted independence systems. In European Symposium on Algorithms, pages 536-548. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15775-2_46.
  28. Anupam Gupta, Viswanath Nagarajan, and Sahil Singla. Adaptivity gaps for stochastic probing: submodular and xos functions. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 1688-1702, USA, 2017. Society for Industrial and Applied Mathematics. URL: https://doi.org/10.1137/1.9781611974782.111.
  29. G. H. Hardy, J. E. Littlewood, and G. Pólya. Inequalities. Cambridge University Press, 1934. Google Scholar
  30. Oscar H. Ibarra and Chul E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22(4):463-468, October 1975. URL: https://doi.org/10.1145/321906.321909.
  31. Sharat Ibrahimpur and Chaitanya Swamy. Approximation algorithms for stochastic minimum-norm combinatorial optimization. In 61st IEEE Annual Symposium on Foundations of Computer Science, pages 966-977, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00094.
  32. Sharat Ibrahimpur and Chaitanya Swamy. Minimum-norm load balancing is (almost) as easy as minimizing makespan. In 48th International Colloquium on Automata, Languages, and Programming, volume 198 of LIPIcs, pages 81:1-81:20, 2021. URL: https://doi.org/10.4230/LIPICS.ICALP.2021.81.
  33. Thomas Kesselheim, Marco Molinaro, and Sahil Singla. Supermodular approximation of norms and applications. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pages 1841-1852, 2024. URL: https://doi.org/10.1145/3618260.3649734.
  34. Andreas Krause and Daniel Golovin. Submodular function maximization. Tractability, 3(71-104):3, 2014. Google Scholar
  35. Jon Lee, Maxim Sviridenko, and Jan Vondrák. Submodular maximization over multiple matroids via generalized exchange properties. Mathematics of Operations Research, 35(4):795-806, 2010. URL: https://doi.org/10.1287/MOOR.1100.0463.
  36. Jian Li and Samir Khuller. Generalized machine activation problems. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 80-94. SIAM, 2011. URL: https://doi.org/10.1137/1.9781611973082.7.
  37. André Linhares, Neil Olver, Chaitanya Swamy, and Rico Zenklusen. Approximate multi-matroid intersection via iterative refinement. Mathematical Programming, 183:397-418, 2020. URL: https://doi.org/10.1007/S10107-020-01524-Y.
  38. Kalen Patton, Matteo Russo, and Sahil Singla. Submodular norms with applications to online facility location and stochastic probing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023. Google Scholar
  39. Ram Ravi and Michel X Goemans. The constrained minimum spanning tree problem. In Algorithm Theory—SWAT'96: 5th Scandinavian Workshop on Algorithm Theory Reykjavík, Iceland, July 3-5, 1996 Proceedings 5, pages 66-75. Springer, 1996. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact