{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T02:23:44Z","timestamp":1768789424532,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613107","type":"print"},{"value":"9783540684534","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:27:30Z","timestamp":1330291650000},"page":"345-358","source":"Crossref","is-referenced-by-count":21,"title":["Coloring bipartite hypergraphs"],"prefix":"10.1007","author":[{"given":"Hui","family":"Chen","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"26_CR1","unstructured":"F.Alizadeh, Combinatorial Optimizations with Semi-definite matrices, 2nd Conference of Integer Programming and Combinatorial Optimizations (1992). pp385\u2013405."},{"key":"26_CR2","unstructured":"N.Alon, N.Kahale, A spectral technique for coloring random 3-colorable graphs, DIMACS TR-94-35."},{"key":"26_CR3","unstructured":"N.Alon, J.Spencer. The Probabilistic Method, John Wiley & Sons (1992)."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"J.Beck, An algorithmic approach to Lov\u00e1sz Local Lemma I, Random Structures & Algorithms (1991). pp343\u2013365.","DOI":"10.1002\/rsa.3240020402"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K. Edwards","year":"1986","unstructured":"K. Edwards, The complexity of coloring problems on dense graphs, Theoretical Computer Science 43 (1986) 337\u2013343.","journal-title":"Theoretical Computer Science"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"M.Goemans, D.Williamson, .878-Approximation Algorithms for MAX CUT and MAX 2SAT. Proceedings of the 26th ACM Symposium on Theory of Computing (1994).","DOI":"10.1145\/195058.195216"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"D.Karger, R.Motwani, M.Sudan, Approximation Graph Coloring by Semidefinite Programming. 35th Foundations of Computer Science (1995). pp2\u201313.","DOI":"10.1109\/SFCS.1994.365710"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"J.Kahn, Szemer\u00e9di, J.Friedman,On the second eigenvalue in random regular graphs, Proceedings of the 21st ACM STOC (1989). pp 587\u2013598.","DOI":"10.1145\/73007.73063"},{"key":"26_CR9","first-page":"3","volume-title":"Covering and coloring of hypergraphs","author":"L. Lov\u00e0sz","year":"1973","unstructured":"L. Lov\u00e0sz, Covering and coloring of hypergraphs, Preceding of the 4th Sourtheastern Conference on Combinatorics, Graph Theory and Computing. Utilitas Mathematica Publishing. Winnipeg (1973). pp 3\u201312."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/S0963548300000730","volume":"2","author":"C.J.H McDiarmid","year":"1993","unstructured":"C.J.H McDiarmid, A random recoloring method for graph and hypergraph, Combinatorial Probability and Computing 2 (1993). pp 363\u2013365.","journal-title":"Combinatorial Probability and Computing"},{"key":"26_CR11","unstructured":"G.Strang, Linear algebra and its applications, Hardcourt Brace Jovanovich Publishing (1988)."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1145\/2157.2158","volume":"30","author":"A. Widgerson","year":"1983","unstructured":"A. Widgerson, Improving the performance gurantee of approximate graph coloring, Journal of ACM 30 (1983). PP 729\u2013735.","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:16:37Z","timestamp":1742598997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}