Document

# On Min-Max Graph Balancing with Strict Negative Correlation Constraints

## File

LIPIcs.ISAAC.2023.50.pdf
• Filesize: 0.72 MB
• 15 pages

## Cite As

Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, and Mong-Jen Kao. On Min-Max Graph Balancing with Strict Negative Correlation Constraints. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 50:1-50:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ISAAC.2023.50

## Abstract

We consider the min-max graph balancing problem with strict negative correlation (SNC) constraints. The graph balancing problem arises as an equivalent formulation of the classic unrelated machine scheduling problem, where we are given a hypergraph G = (V,E) with vertex-dependent edge weight function p: E×V ↦ ℤ^{≥0} that represents the processing time of the edges (jobs). The SNC constraints, which are given as edge subsets C_1,C_2,…,C_k, require that the edges in the same subset cannot be assigned to the same vertex at the same time. Under these constraints, the goal is to compute an edge orientation (assignment) that minimizes the maximum workload of the vertices. In this paper, we conduct a general study on the approximability of this problem. First, we show that, in the presence of SNC constraints, the case with max_{e ∈ E} |e| = max_i |C_i| = 2 is the only case for which approximation solutions can be obtained. Further generalization on either direction, e.g., max_{e ∈ E} |e| or max_i |C_i|, will directly make computing a feasible solution an NP-complete problem to solve. Then, we present a 2-approximation algorithm for the case with max_{e ∈ E} |e| = max_i |C_i| = 2, based on a set of structural simplifications and a tailored assignment LP for this problem. We note that our approach is general and can be applied to similar settings, e.g., scheduling with SNC constraints to minimize the weighted completion time, to obtain similar approximation guarantees. Further cases are discussed to describe the landscape of the approximability of this prbolem. For the case with |V| ≤ 2, which is already known to be NP-hard, we present a fully-polynomial time approximation scheme (FPTAS). On the other hand, we show that the problem is at least as hard as vertex cover to approximate when |V| ≥ 3.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Scheduling algorithms
##### Keywords
• Unrelated Scheduling
• Graph Balancing
• Strict Correlation Constraints

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Chidambaram Annamalai, Christos Kalaitzis, and Ola Svensson. Combinatorial algorithm for restricted max-min fair allocation. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1357-1372. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.90.
2. Arash Asadpour, Uriel Feige, and Amin Saberi. Santa claus meets hypergraph matchings. In Ashish Goel, Klaus Jansen, José D. P. Rolim, and Ronitt Rubinfeld, editors, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, volume 5171 of Lecture Notes in Computer Science, pages 10-20. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-85363-3_2.
3. Nikhil Bansal, Aravind Srinivasan, and Ola Svensson. Lift-and-round to improve weighted completion time on unrelated machines. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 156-167. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897572.
4. Nikhil Bansal and Maxim Sviridenko. The santa claus problem. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pages 31-40. ACM, 2006. URL: https://doi.org/10.1145/1132516.1132522.
5. Alok Baveja, Xiaoran Qu, and Aravind Srinivasan. Approximating weighted completion time via stronger negative correlation. Journal of Scheduling, pages 1-10, 2023.
6. Ivona Bezáková and Varsha Dani. Allocating indivisible goods. SIGecom Exch., 5(3):11-18, 2005. URL: https://doi.org/10.1145/1120680.1120683.
7. Hans L. Bodlaender, Klaus Jansen, and Gerhard J. Woeginger. Scheduling with incompatible jobs. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings, volume 657 of Lecture Notes in Computer Science, pages 37-49. Springer, 1992. URL: https://doi.org/10.1007/3-540-56402-0_34.
8. Deeparnab Chakrabarty, Julia Chuzhoy, and Sanjeev Khanna. On allocating goods to maximize fairness. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pages 107-116. IEEE Computer Society, 2009. URL: https://doi.org/10.1109/FOCS.2009.51.
9. Deeparnab Chakrabarty, Sanjeev Khanna, and Shi Li. On (1,)-restricted assignment makespan minimization. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1087-1101. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.73.
10. Deeparnab Chakrabarty and Kirankumar Shiragur. Graph balancing with two edge types. CoRR, abs/1604.06918, 2016. URL: https://arxiv.org/abs/1604.06918.
11. Siu-Wing Cheng and Yuchen Mao. Restricted max-min fair allocation. In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, editors, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, volume 107 of LIPIcs, pages 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.37.
12. Siu-Wing Cheng and Yuchen Mao. Restricted max-min allocation: Approximation and integrality gap. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132 of LIPIcs, pages 38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.38.
13. Syamantak Das and Andreas Wiese. On minimizing the makespan when some jobs cannot be assigned on the same machine. In Kirk Pruhs and Christian Sohler, editors, 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, volume 87 of LIPIcs, pages 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ESA.2017.31.
14. Sami Davies, Thomas Rothvoss, and Yihao Zhang. A tale of santa claus, hypergraphs and matroids. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 2748-2757. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.167.
15. Irit Dinur, Oded Regev, and Clifford D. Smyth. The hardness of 3 - uniform hypergraph coloring. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, page 33. IEEE Computer Society, 2002. URL: https://doi.org/10.1109/SFCS.2002.1181880.
16. Tomás Ebenlendr, Marek Krcál, and Jirí Sgall. Graph balancing: a special case of scheduling unrelated parallel machines. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 483-490. SIAM, 2008. URL: http://dl.acm.org/citation.cfm?id=1347082.1347135.
17. Uriel Feige. On allocations that maximize fairness. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 287-293. SIAM, 2008. URL: http://dl.acm.org/citation.cfm?id=1347082.1347114.
18. Penny Haxell and Tibor Szabó. Improved integrality gap in max-min allocation: or topology at the north pole. 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 2875-2897. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch109.
19. Chien-Chung Huang and Sebastian Ott. A combinatorial approximation algorithm for graph balancing with light hyper edges. In Piotr Sankowski and Christos D. Zaroliagis, editors, 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, volume 57 of LIPIcs, pages 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.ESA.2016.49.
20. Klaus Jansen, Alexandra Lassota, and Marten Maack. Approximation algorithms for scheduling with class constraints. In Christian Scheideler and Michael Spear, editors, SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pages 349-357. ACM, 2020. URL: https://doi.org/10.1145/3350755.3400247.
21. Klaus Jansen and Lars Rohwedder. On the configuration-lp of the restricted assignment problem. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 2670-2678. SIAM, 2017. URL: https://doi.org/10.1137/1.9781611974782.176.
22. Jan Karel Lenstra, David B. Shmoys, and Éva Tardos. Approximation algorithms for scheduling unrelated parallel machines. In 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987, pages 217-224. IEEE Computer Society, 1987. URL: https://doi.org/10.1109/SFCS.1987.8.
23. Daniel R. Page and Roberto Solis-Oba. A 3/2-approximation algorithm for the graph balancing problem with two weights. Algorithms, 9(2):38, 2016. URL: https://doi.org/10.3390/a9020038.
24. Daniel R. Page and Roberto Solis-Oba. Makespan minimization on unrelated parallel machines with a few bags. In Shaojie Tang, Ding-Zhu Du, David L. Woodruff, and Sergiy Butenko, editors, Algorithmic Aspects in Information and Management - 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3-4, 2018, Proceedings, volume 11343 of Lecture Notes in Computer Science, pages 24-35. Springer, 2018. URL: https://doi.org/10.1007/978-3-030-04618-7_3.
25. Tytus Pikies, Krzysztof Turowski, and Marek Kubale. Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms. Artif. Intell., 309:103711, 2022. URL: https://doi.org/10.1016/j.artint.2022.103711.
26. Petra Schuurman and Gerhard J Woeginger. Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling, 2(5):203-213, 1999.
27. Ola Svensson. Santa claus schedules jobs on unrelated machines. In Lance Fortnow and Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 617-626. ACM, 2011. URL: https://doi.org/10.1145/1993636.1993718.
28. José Verschae and Andreas Wiese. On the configuration-lp for scheduling on unrelated machines. In Camil Demetrescu and Magnús M. Halldórsson, editors, Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings, volume 6942 of Lecture Notes in Computer Science, pages 530-542. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-23719-5_45.
29. David P. Williamson and David B. Shmoys. The Design of Approximation Algorithms. Cambridge University Press, 2011. URL: http://www.cambridge.org/de/knowledge/isbn/item5759340/?site_locale=de_DE.
X

Feedback for Dagstuhl Publishing