{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:59Z","timestamp":1725664739947},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_119","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:34Z","timestamp":1330274254000},"page":"41-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Approximate hypergraph coloring"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Kelsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Mahajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hariharan","family":"Ramesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"5_CR1","unstructured":"F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, Proc. of the 2nd MPS Conference on Integer Programming and Combinatorial Optimization, Carnegie Mellon University, 1992."},{"key":"5_CR2","unstructured":"N. Alon, N. Kahale, Approximating Maximum Independent Sets, Manuscript, 1995."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1145\/176584.176586","volume":"41","author":"A. Blum","year":"1994","unstructured":"A. Blum, New Approximation Algorithms for Graph Coloring, JACM, 41, pp. 470\u2013516, 1994.","journal-title":"JACM"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"A. Frieze, M.Jerrum, Improved Approximation Algorithms for Max k-Cut and Max Bisection, IPCO, 1995.","DOI":"10.1007\/3-540-59408-6_37"},{"key":"5_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey AND D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"M. Goemans, D. Williamson, 0.878 Approximation Algorithms for Max Cut and Max 2SAT, Proc. of 26th Annual Symposium on the Theory of Computing, pp. 422\u2013431, 1993.","DOI":"10.1145\/195058.195216"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lovasz, A Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1, pp. 169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"5_CR8","unstructured":"D. Karger, R. Motwani, M. Sudan, Approximate Graph Coloring by Semidefinite Programming, Proc. of the 35th IEEE Symposium on Foundations of Computer Science, pp. 1\u201310, 1994."},{"key":"5_CR9","unstructured":"L. Lovasz, Colorings and Coverings of Hypergraphs, Proc. 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publishing, Winnipeg, pp. 3\u201312."},{"key":"5_CR10","unstructured":"S. Mahajan, H. Ramesh, Derandomizing Semidefinite Programming Based Approximation Algorithms, Proc. of the 36th IEEE Symposium on Foundations of Computer Science, 1995, to appear."},{"issue":"4","key":"5_CR11","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1145\/2157.2158","volume":"30","author":"A. Wigderson","year":"1983","unstructured":"A. Wigderson, Improving the Performance Guarantee for Approximate Graph Coloring, JACM 30(4), pp. 729\u2013735, 1983.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T05:34:34Z","timestamp":1640928874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_119","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}