{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T14:06:53Z","timestamp":1778335613994,"version":"3.51.4"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2022,1,31]]},"abstract":"<jats:p>\n            An\n            <jats:italic>independent transversal<\/jats:italic>\n            (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph and vertex partition, which have been used over the years to solve many combinatorial problems. Some of these IT existence theorems have algorithmic proofs, but there remains a gap between the best existential bounds and the bounds obtainable by efficient algorithms.\n          <\/jats:p>\n          <jats:p>Recently, Graf and Haxell (2018) described a new (deterministic) algorithm that asymptotically closes this gap, but there are limitations on its applicability. In this article, we develop a randomized algorithm that is much more widely applicable, and demonstrate its use by giving efficient algorithms for two problems concerning the strong chromatic number of graphs.<\/jats:p>","DOI":"10.1145\/3474057","type":"journal-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T15:10:11Z","timestamp":1638457811000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for Weighted Independent Transversals and Strong Colouring"],"prefix":"10.1145","volume":"18","author":[{"given":"Alessandra","family":"Graf","sequence":"first","affiliation":[{"name":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David G.","family":"Harris","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Penny","family":"Haxell","sequence":"additional","affiliation":[{"name":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-2086-y"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02783300"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030102"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/3002498"},{"key":"e_1_3_2_6_2","first-page":"196","volume-title":"Proceedings of the 4th SIAM Symposium on Simplicity in Algorithm (SOSA\u201921)","author":"Anegg G.","unstructured":"G. Anegg, H. Angelidakis, and R. Zenklusen. Simpler and stronger approaches for non-uniform hypergraph matching and the F\u00fcredi, Kahn, and Seymour Conjecture. In Proceedings of the 4th SIAM Symposium on Simplicity in Algorithm (SOSA\u201921), 196\u2013203."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-017-3567-2"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/050633056"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548311000253"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10033"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0094-9000-09-00754-6"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0403018"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90588-7"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548320000127"},{"key":"e_1_3_2_15_2","unstructured":"A. Graf. Finding Independent Transversals Efficiently . Ph.D. Thesis. University of Waterloo (2019)."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20914"},{"key":"e_1_3_2_18_2","unstructured":"D. Harris. 2019. Deterministic algorithms for the Lov\u00e1sz Local Lemma: Simpler more general and more parallel. arXiv:1909.08065. Retrieved from https:\/\/arxiv.org\/abs\/1909.08065."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3015762"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2017.v013a017"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3039869"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01793010"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004758"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006157"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/1365481.1365486"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.4169\/amer.math.monthly.118.09.777"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548318000561"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008607"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21768"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0019-9"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3474057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:47Z","timestamp":1750193327000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,31]]}},"alternative-id":["10.1145\/3474057"],"URL":"https:\/\/doi.org\/10.1145\/3474057","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,2]]},"assertion":[{"value":"2020-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}