Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
A hypergraph H on n vertices and m edges is said to be nearly-intersecting if every edge of H intersects all but at most polylogarthmically many (in m and n) other edges. Given lists of colors L(v), for each vertex v∈V, H is said to be L-(list) colorable, if each vertex can be assigned a color from...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 902; s. 64 - 75 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
18.01.2022
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | A hypergraph H on n vertices and m edges is said to be nearly-intersecting if every edge of H intersects all but at most polylogarthmically many (in m and n) other edges. Given lists of colors L(v), for each vertex v∈V, H is said to be L-(list) colorable, if each vertex can be assigned a color from its list such that no edge in H is monochromatic. We show that list-colorability for any nearly intersecting hypergraph, and lists drawn from a set of constant size, can be checked in quasi-polynomial time in m and n. |
|---|---|
| AbstractList | A hypergraph H on n vertices and m edges is said to be nearly-intersecting if every edge of H intersects all but at most polylogarthmically many (in m and n) other edges. Given lists of colors L(v), for each vertex v∈V, H is said to be L-(list) colorable, if each vertex can be assigned a color from its list such that no edge in H is monochromatic. We show that list-colorability for any nearly intersecting hypergraph, and lists drawn from a set of constant size, can be checked in quasi-polynomial time in m and n. |
| Author | Elbassioni, Khaled |
| Author_xml | – sequence: 1 givenname: Khaled surname: Elbassioni fullname: Elbassioni, Khaled email: khaled.elbassioni@ku.ac.ae organization: Khalifa University of Science and Technology, Abu Dhabi, United Arab Emirates |
| BookMark | eNp9kM9KxDAQh4Os4O7qA3jrC6Qmado0eJLFf7Cggp5Dmk3alGxSkir07c2ynp3LDD_4hplvA1Y-eA3ALUYlRri5G8tZpZIggktMSoT4BVjjlnFICKcrsEYVorDirL4Cm5RGlKtmzRq8f3zLZOEU3OLD0UpXSNeHaOfhmAoTYuFsmqEKLme-L4IpvJbRLYX1s45Jq_kUD8ukYx_lNKRrcGmkS_rmr2_B19Pj5-4F7t-eX3cPe6gI5TNspGpqSRRiHaWoqQ3peMu1QaZivJVMKmUYq2QjO0pMbRjvWsVr3tFO55FUW4DPe1UMKUVtxBTtUcZFYCROSsQoshJxUiIwEVlJZu7PjM6H_VgdRVJWe6UPNuZPxCHYf-hfuaRtyA |
| Cites_doi | 10.1016/S0166-218X(96)00085-6 10.1016/j.dam.2007.05.030 10.1090/fim/017 10.1006/inco.1995.1157 10.1007/s00493-005-0032-4 10.1016/S0166-218X(01)00179-2 10.1016/S0020-0190(02)00346-0 10.1093/qmath/25.1.303 10.1016/S0012-365X(96)00208-7 10.1137/S009753970240639X 10.1006/jagm.1996.0062 10.1137/S0097539793250299 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier B.V. |
| Copyright_xml | – notice: 2021 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2021.12.009 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 75 |
| ExternalDocumentID | 10_1016_j_tcs_2021_12_009 S0304397521007234 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FGOYB G-2 HZ~ R2- SEW SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c249t-6ac65a2c07b44065f2b989ef0f3798a7accf773a6ab42f5f79b8c959b4be9b823 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000741395300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:23:41 EST 2025 Fri Feb 23 02:40:37 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | List coloring Hypergraph dualization Quasi-polynomial algorithm Hypergraph coloring Exact algorithms |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c249t-6ac65a2c07b44065f2b989ef0f3798a7accf773a6ab42f5f79b8c959b4be9b823 |
| PageCount | 12 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2021_12_009 elsevier_sciencedirect_doi_10_1016_j_tcs_2021_12_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-01-18 |
| PublicationDateYYYYMMDD | 2022-01-18 |
| PublicationDate_xml | – month: 01 year: 2022 text: 2022-01-18 day: 18 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Dinur, Regev, Smyth (br0040) 2005; 25 Seymour (br0200) 1974; 25 Fredman, Khachiyan (br0310) 1996; 21 Domingo (br0260) 1997 Bioch, Ibaraki (br0240) 1995; 123 Gaur, Krishnamurti (br0330) 2004 Boros, Makino (br0250) 2009 Krivelevich, Nathaniel, Sudakov (br0100) 2001 de Werra (br0190) 1997; 165–166 Voloshin (br0070) 2002 Lovász (br0220) 2000 Dinur, Guruswami (br0030) 2013 Alon, Kelsen, Mahajan, Hariharan (br0080) 1996; 3 Bhattiprolu, Guruswami, Lee (br0130) 2015 Person, Schacht (br0150) 2009; vol. 34 Takata (br0360) 2002 Gottlob, Malizia (br0340) 2014 Guruswami, Harsha, Håstad, Srinivasan, Varma (br0050) 2014 Kavvadias, Stavropoulos (br0350) 2003; 85 Gravier, Kobler, Kubiak (br0170) 2002; 117 Bacsó, Bujtás, Tuza, Voloshin (br0010) 2008 Gottlob (br0320) 2004 Erdős, Rubin, Taylor (br0110) 1979 Kubiak, Gravier, Dror (br0160) 1999; 195 Jansen, Scheffler (br0180) 1997; 75 Khot, Saket (br0060) 2014 Vizing (br0120) 1976; 29 Papadimitriou (br0230) 1997 Pei (br0370) 2008 Elbassioni (br0270) 2008; 156 Chattopadhyay, Reed (br0140) 2007 Beck, Lodha (br0020) 2002 Eiter, Gottlob (br0210) 1995; 24 Chen, Frieze (br0090) 1996 Eiter, Gottlob, Makino (br0290) 2003; 32 Eiter, Gottlob, Makino (br0280) 2002 Eiter, Makino, Gottlob (br0300) 2006 Khot (10.1016/j.tcs.2021.12.009_br0060) 2014 Gravier (10.1016/j.tcs.2021.12.009_br0170) 2002; 117 Jansen (10.1016/j.tcs.2021.12.009_br0180) 1997; 75 Vizing (10.1016/j.tcs.2021.12.009_br0120) 1976; 29 Domingo (10.1016/j.tcs.2021.12.009_br0260) 1997 Chen (10.1016/j.tcs.2021.12.009_br0090) 1996 Lovász (10.1016/j.tcs.2021.12.009_br0220) 2000 Elbassioni (10.1016/j.tcs.2021.12.009_br0270) 2008; 156 Takata (10.1016/j.tcs.2021.12.009_br0360) 2002 Kavvadias (10.1016/j.tcs.2021.12.009_br0350) 2003; 85 Guruswami (10.1016/j.tcs.2021.12.009_br0050) 2014 Boros (10.1016/j.tcs.2021.12.009_br0250) 2009 Dinur (10.1016/j.tcs.2021.12.009_br0030) 2013 Eiter (10.1016/j.tcs.2021.12.009_br0210) 1995; 24 Gottlob (10.1016/j.tcs.2021.12.009_br0320) 2004 Fredman (10.1016/j.tcs.2021.12.009_br0310) 1996; 21 Gottlob (10.1016/j.tcs.2021.12.009_br0340) 2014 Seymour (10.1016/j.tcs.2021.12.009_br0200) 1974; 25 Krivelevich (10.1016/j.tcs.2021.12.009_br0100) 2001 Chattopadhyay (10.1016/j.tcs.2021.12.009_br0140) 2007 Dinur (10.1016/j.tcs.2021.12.009_br0040) 2005; 25 de Werra (10.1016/j.tcs.2021.12.009_br0190) 1997; 165–166 Bioch (10.1016/j.tcs.2021.12.009_br0240) 1995; 123 Eiter (10.1016/j.tcs.2021.12.009_br0290) 2003; 32 Kubiak (10.1016/j.tcs.2021.12.009_br0160) 1999; 195 Bhattiprolu (10.1016/j.tcs.2021.12.009_br0130) 2015 Gaur (10.1016/j.tcs.2021.12.009_br0330) 2004 Person (10.1016/j.tcs.2021.12.009_br0150) 2009; vol. 34 Pei (10.1016/j.tcs.2021.12.009_br0370) 2008 Beck (10.1016/j.tcs.2021.12.009_br0020) 2002 Eiter (10.1016/j.tcs.2021.12.009_br0280) 2002 Eiter (10.1016/j.tcs.2021.12.009_br0300) 2006 Bacsó (10.1016/j.tcs.2021.12.009_br0010) 2008 Voloshin (10.1016/j.tcs.2021.12.009_br0070) 2002 Erdős (10.1016/j.tcs.2021.12.009_br0110) 1979 Papadimitriou (10.1016/j.tcs.2021.12.009_br0230) 1997 Alon (10.1016/j.tcs.2021.12.009_br0080) 1996; 3 |
| References_xml | – year: 2006 ident: br0300 article-title: Computational aspects of monotone dualization: a brief survey – year: 2007 ident: br0140 article-title: Properly 2-colouring linear hypergraphs publication-title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007. Proceedings – volume: 25 start-page: 519 year: 2005 end-page: 535 ident: br0040 article-title: The hardness of 3-uniform hypergraph coloring publication-title: Combinatorica – volume: 29 start-page: 3 year: 1976 end-page: 10 ident: br0120 article-title: Vertex colorings with given colors publication-title: Metody Diskretn. Anal. – year: 2002 ident: br0070 article-title: Coloring Mixed Hypergraphs: Theory, Algorithms, and Applications publication-title: Fields Institute Monographs – volume: vol. 34 start-page: 465 year: 2009 end-page: 469 ident: br0150 article-title: An expected polynomial time algorithm for coloring 2-colorable 3-graphs publication-title: European Conference on Combinatorics, Graph Theory and Applications – start-page: 67 year: 2008 end-page: 78 ident: br0010 article-title: New challenges in the theory of hypergraph coloring publication-title: ICDM 2008. International Conference on Discrete Mathematics – start-page: 614 year: 2014 end-page: 623 ident: br0050 article-title: Super-polylogarithmic hypergraph coloring hardness via low-degree long codes publication-title: Symposium on Theory of Computing – start-page: 14 year: 2002 end-page: 22 ident: br0280 article-title: New results on monotone dualization and generating hypergraph transversals publication-title: STOC '02: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing – volume: 75 start-page: 135 year: 1997 end-page: 155 ident: br0180 article-title: Generalized coloring for tree-like graphs publication-title: Discrete Appl. Math. – start-page: 2 year: 1997 end-page: 6 ident: br0230 article-title: NP-completeness: a retrospective publication-title: ICALP '97: Proceedings of the 24th International Colloquium on Automata, Languages and Programming – year: 2000 ident: br0220 article-title: Combinatorial optimization: some problems and trends – volume: 21 start-page: 618 year: 1996 end-page: 628 ident: br0310 article-title: On the complexity of dualization of monotone disjunctive normal forms publication-title: J. Algorithms – volume: 32 start-page: 514 year: 2003 end-page: 537 ident: br0290 article-title: New results on monotone dualization and generating hypergraph transversals publication-title: SIAM J. Comput. – start-page: 109 year: 2002 end-page: 120 ident: br0360 article-title: On the sequential method for listing minimal hitting sets publication-title: DM & DM 2002: Proceedings of Workshop on Discrete Mathematics and Data Mining, 2nd SIAM International Conference on Data Mining – volume: 123 start-page: 50 year: 1995 end-page: 63 ident: br0240 article-title: Complexity of identification and dualization of positive Boolean functions publication-title: Inf. Comput. – start-page: 598 year: 2002 end-page: 605 ident: br0020 article-title: Efficient proper 2-coloring of almost disjoint hypergraphs publication-title: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms – start-page: 340 year: 2013 end-page: 349 ident: br0030 article-title: PCPs via low-degree long code and hardness for constrained hypergraph coloring publication-title: 54th Annual IEEE Symposium on Foundations of Computer Science – volume: 156 start-page: 2109 year: 2008 end-page: 2123 ident: br0270 article-title: On the complexity of monotone dualization and generating minimal hypergraph transversals publication-title: Discrete Appl. Math. – start-page: 1 year: 2004 end-page: 5 ident: br0320 article-title: Hypergraph transversals publication-title: FoIKS '04: Proceedings of the 3rd International Symposium on Foundations of Information and Knowledge Systems – volume: 165–166 start-page: 161 year: 1997 end-page: 170 ident: br0190 article-title: Restricted coloring models for timetabling publication-title: Discrete Math. – volume: 3 start-page: 425 year: 1996 end-page: 439 ident: br0080 article-title: Approximate hypergraph coloring publication-title: Nord. J. Comput. – start-page: 345 year: 1996 end-page: 358 ident: br0090 article-title: Coloring bipartite hypergraphs publication-title: Integer Programming and Combinatorial Optimization: 5th International IPCO Conference Vancouver, British Columbia, Canada, June 3–5, 1996 Proceedings – start-page: 171 year: 1997 end-page: 180 ident: br0260 article-title: Polynominal time algorithms for some self-duality problems publication-title: CIAC '97: Proceedings of the 3rd Italian Conference on Algorithms and Complexity – volume: 85 start-page: 1 year: 2003 end-page: 6 ident: br0350 article-title: Monotone Boolean dualization is in co-NP publication-title: Inf. Process. Lett. – volume: 195 start-page: 103 year: 1999 end-page: 109 ident: br0160 article-title: On the complexity of a restricted list-coloring problem publication-title: Discrete Math. – volume: 24 start-page: 1278 year: 1995 end-page: 1304 ident: br0210 article-title: Identifying the minimal transversals of a hypergraph and related problems publication-title: SIAM J. Comput. – start-page: 43:1 year: 2014 end-page: 43:10 ident: br0340 article-title: Achieving new upper bounds for the hypergraph duality problem through logic publication-title: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) – start-page: 152 year: 2015 end-page: 174 ident: br0130 article-title: Approximate hypergraph coloring under low-discrepancy and related promises publication-title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques – volume: 117 start-page: 65 year: 2002 end-page: 79 ident: br0170 article-title: Complexity of list coloring problems with a fixed total number of colors publication-title: Discrete Appl. Math. – start-page: 327 year: 2001 end-page: 328 ident: br0100 article-title: Approximating coloring and maximum independent sets in 3-uniform hypergraphs publication-title: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms – year: 2008 ident: br0370 article-title: List colouring hypergraphs and extremal results for acyclic graphs – start-page: 183 year: 2009 end-page: 194 ident: br0250 article-title: A fast and simple parallel algorithm for the monotone duality problem publication-title: Automata, Languages and Programming, 36th International Colloquium – start-page: 125 year: 1979 end-page: 157 ident: br0110 article-title: Choosability in graphs publication-title: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing – start-page: 322 year: 2004 end-page: 338 ident: br0330 article-title: Average case self-duality of monotone Boolean functions publication-title: Canadian AI '04: Proceedings of the 17th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence – start-page: 206 year: 2014 end-page: 215 ident: br0060 article-title: Hardness of coloring 2-colorable 12-uniform hypergraphs with publication-title: 55th IEEE Annual Symposium on Foundations of Computer Science – volume: 25 start-page: 303 year: 1974 end-page: 311 ident: br0200 article-title: An expected polynomial time algorithm for coloring 2-colorable 3-graphs publication-title: Q. J. Math. – volume: 75 start-page: 135 issue: 2 year: 1997 ident: 10.1016/j.tcs.2021.12.009_br0180 article-title: Generalized coloring for tree-like graphs publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(96)00085-6 – volume: 156 start-page: 2109 issue: 11 year: 2008 ident: 10.1016/j.tcs.2021.12.009_br0270 article-title: On the complexity of monotone dualization and generating minimal hypergraph transversals publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2007.05.030 – start-page: 322 year: 2004 ident: 10.1016/j.tcs.2021.12.009_br0330 article-title: Average case self-duality of monotone Boolean functions – year: 2002 ident: 10.1016/j.tcs.2021.12.009_br0070 article-title: Coloring Mixed Hypergraphs: Theory, Algorithms, and Applications doi: 10.1090/fim/017 – volume: 29 start-page: 3 year: 1976 ident: 10.1016/j.tcs.2021.12.009_br0120 article-title: Vertex colorings with given colors publication-title: Metody Diskretn. Anal. – start-page: 43:1 year: 2014 ident: 10.1016/j.tcs.2021.12.009_br0340 article-title: Achieving new upper bounds for the hypergraph duality problem through logic – start-page: 14 year: 2002 ident: 10.1016/j.tcs.2021.12.009_br0280 article-title: New results on monotone dualization and generating hypergraph transversals – start-page: 598 year: 2002 ident: 10.1016/j.tcs.2021.12.009_br0020 article-title: Efficient proper 2-coloring of almost disjoint hypergraphs – year: 2008 ident: 10.1016/j.tcs.2021.12.009_br0370 – year: 2000 ident: 10.1016/j.tcs.2021.12.009_br0220 – volume: 123 start-page: 50 issue: 1 year: 1995 ident: 10.1016/j.tcs.2021.12.009_br0240 article-title: Complexity of identification and dualization of positive Boolean functions publication-title: Inf. Comput. doi: 10.1006/inco.1995.1157 – year: 2006 ident: 10.1016/j.tcs.2021.12.009_br0300 – start-page: 183 year: 2009 ident: 10.1016/j.tcs.2021.12.009_br0250 article-title: A fast and simple parallel algorithm for the monotone duality problem – volume: 25 start-page: 519 issue: 5 year: 2005 ident: 10.1016/j.tcs.2021.12.009_br0040 article-title: The hardness of 3-uniform hypergraph coloring publication-title: Combinatorica doi: 10.1007/s00493-005-0032-4 – start-page: 2 year: 1997 ident: 10.1016/j.tcs.2021.12.009_br0230 article-title: NP-completeness: a retrospective – volume: 117 start-page: 65 issue: 1–3 year: 2002 ident: 10.1016/j.tcs.2021.12.009_br0170 article-title: Complexity of list coloring problems with a fixed total number of colors publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00179-2 – start-page: 67 year: 2008 ident: 10.1016/j.tcs.2021.12.009_br0010 article-title: New challenges in the theory of hypergraph coloring – volume: 85 start-page: 1 issue: 1 year: 2003 ident: 10.1016/j.tcs.2021.12.009_br0350 article-title: Monotone Boolean dualization is in co-NP[log2n] publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(02)00346-0 – volume: 25 start-page: 303 issue: 1 year: 1974 ident: 10.1016/j.tcs.2021.12.009_br0200 article-title: An expected polynomial time algorithm for coloring 2-colorable 3-graphs publication-title: Q. J. Math. doi: 10.1093/qmath/25.1.303 – start-page: 340 year: 2013 ident: 10.1016/j.tcs.2021.12.009_br0030 article-title: PCPs via low-degree long code and hardness for constrained hypergraph coloring – start-page: 206 year: 2014 ident: 10.1016/j.tcs.2021.12.009_br0060 article-title: Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn)Ω(1) colors – start-page: 1 year: 2004 ident: 10.1016/j.tcs.2021.12.009_br0320 article-title: Hypergraph transversals – start-page: 109 year: 2002 ident: 10.1016/j.tcs.2021.12.009_br0360 article-title: On the sequential method for listing minimal hitting sets – volume: 195 start-page: 103 issue: 1–3 year: 1999 ident: 10.1016/j.tcs.2021.12.009_br0160 article-title: On the complexity of a restricted list-coloring problem publication-title: Discrete Math. – volume: 165–166 start-page: 161 year: 1997 ident: 10.1016/j.tcs.2021.12.009_br0190 article-title: Restricted coloring models for timetabling publication-title: Discrete Math. doi: 10.1016/S0012-365X(96)00208-7 – volume: 32 start-page: 514 issue: 2 year: 2003 ident: 10.1016/j.tcs.2021.12.009_br0290 article-title: New results on monotone dualization and generating hypergraph transversals publication-title: SIAM J. Comput. doi: 10.1137/S009753970240639X – start-page: 125 year: 1979 ident: 10.1016/j.tcs.2021.12.009_br0110 article-title: Choosability in graphs – start-page: 152 year: 2015 ident: 10.1016/j.tcs.2021.12.009_br0130 article-title: Approximate hypergraph coloring under low-discrepancy and related promises – start-page: 614 year: 2014 ident: 10.1016/j.tcs.2021.12.009_br0050 article-title: Super-polylogarithmic hypergraph coloring hardness via low-degree long codes – volume: 3 start-page: 425 issue: 4 year: 1996 ident: 10.1016/j.tcs.2021.12.009_br0080 article-title: Approximate hypergraph coloring publication-title: Nord. J. Comput. – start-page: 171 year: 1997 ident: 10.1016/j.tcs.2021.12.009_br0260 article-title: Polynominal time algorithms for some self-duality problems – volume: 21 start-page: 618 year: 1996 ident: 10.1016/j.tcs.2021.12.009_br0310 article-title: On the complexity of dualization of monotone disjunctive normal forms publication-title: J. Algorithms doi: 10.1006/jagm.1996.0062 – year: 2007 ident: 10.1016/j.tcs.2021.12.009_br0140 article-title: Properly 2-colouring linear hypergraphs – volume: 24 start-page: 1278 issue: 6 year: 1995 ident: 10.1016/j.tcs.2021.12.009_br0210 article-title: Identifying the minimal transversals of a hypergraph and related problems publication-title: SIAM J. Comput. doi: 10.1137/S0097539793250299 – start-page: 327 year: 2001 ident: 10.1016/j.tcs.2021.12.009_br0100 article-title: Approximating coloring and maximum independent sets in 3-uniform hypergraphs – start-page: 345 year: 1996 ident: 10.1016/j.tcs.2021.12.009_br0090 article-title: Coloring bipartite hypergraphs – volume: vol. 34 start-page: 465 year: 2009 ident: 10.1016/j.tcs.2021.12.009_br0150 article-title: An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
| SSID | ssj0000576 |
| Score | 2.3373735 |
| Snippet | A hypergraph H on n vertices and m edges is said to be nearly-intersecting if every edge of H intersects all but at most polylogarthmically many (in m and n)... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 64 |
| SubjectTerms | Exact algorithms Hypergraph coloring Hypergraph dualization List coloring Quasi-polynomial algorithm |
| Title | Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs |
| URI | https://dx.doi.org/10.1016/j.tcs.2021.12.009 |
| Volume | 902 |
| WOSCitedRecordID | wos000741395300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211209 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLembgc4ABsgxpd82InJKHHjOD5OaNNAbBpSkXqLbNemnaq0SjI0_nueY6fxCpPYgUsUWYmT-PfyPuzn30PoiKXSZCrPiAR5gQBFzIikUhFjUqptysdSd1VLvvLLy2I6FVehhnvTlRPgVVXc3or1f4Ua2gBst3X2AXBvOoUGOAfQ4Qiww_GfgP92I5sFWa-Wv9yOY0cFsPyxqhft3FMvHC8BWOK4quuQ8FyZjuTYEUfUjdN_0DyH8LTuyKyb2H2dRNsedagHcRyM6JAFApbRzcH5PIE5WKBZPLdAXZIGidWhWzcl4LGwWF-KhEYaz3OQB9vpL_xDK_sJguuPrXYE6TTtJmATMZigftl9yzJt8gX7VLTrErooXRdlSstu4-Yu5UwUI7R78vl0-mUwwoz7ZerwAf2Cdpfat_Uef3dJIjdj8gw9CfEBPvG47qMdUx2gp33tDRxU8QF6fLHh222eo6tt0PEAOgbQ8R3Q8cpiDzqOQccR6C_Q97PTyadzEmplEA0BdEtyqXMmqU64ysBHY5YqUQhjEzvmopBcam05_Hm5VBm1zHKhCi2YUJkycErHL9GoWlXmFcLg0iWKKTVLlItHpQCP0-Tjmc1AQmyuDtGHfrjKtadEKe8F6BBl_YCWQRy9r1aCcNx_2-uHPOMNejQI71s0ausb8w7t6Z_toqnfB8n4DT9_cMw |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Quasi-polynomial+algorithms+for+list-coloring+of+nearly+intersecting+hypergraphs&rft.jtitle=Theoretical+computer+science&rft.au=Elbassioni%2C+Khaled&rft.date=2022-01-18&rft.issn=0304-3975&rft.volume=902&rft.spage=64&rft.epage=75&rft_id=info:doi/10.1016%2Fj.tcs.2021.12.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2021_12_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |