{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T11:59:30Z","timestamp":1752667170830},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_22","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"237-247","source":"Crossref","is-referenced-by-count":20,"title":["An Approximation Algorithm for Max p-Section"],"prefix":"10.1007","author":[{"given":"Gunnar","family":"Andersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"22_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley, New York, 1992."},{"key":"22_CR2","unstructured":"Gunnar Andersson, Lars Engebretsen, and Johan H\u00e5stad. A new way to use semidefinite programming with applications to linear equations mod p. In Proc. Tenth Ann. ACM-SIAM Symp. on Discrete Algorithms, 1999."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. In Proc. 4th Conf. on Integer Prog. and Combinatorial Optimization, volume 920 of Lecture Notes in Comput. Sci., pages 1\u201313, Berlin, 1995. Springer-Verlag.","DOI":"10.1007\/3-540-59408-6_37"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/195058.195216","volume-title":"Proc. Twenty-sixth Ann. ACM Symp. on Theory of Comp.","author":"M. X. Goemans","year":"1994","unstructured":"Michel X. Goemans and David P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. Twenty-sixth Ann. ACM Symp. on Theory of Comp., pages 422\u2013431. ACM, New York, 1994."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/258533.258536","volume-title":"Proc. Twenty-nineth Ann. ACM Symp. on Theory of Comp.","author":"J. H\u00e5stad","year":"1997","unstructured":"Johan H\u00e5stad. Some optimal inapproximability results. In Proc. Twenty-nineth Ann. ACM Symp. on Theory of Comp., pages 1\u201310. ACM, New York, 1997."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Richard M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013103. Plenum Press, New York, NY, 1972."},{"key":"22_CR7","first-page":"617","volume-title":"Proc. of 37th Ann. IEEE Symp. on Foundations of Comput. Sci.","author":"L. Trevisan","year":"1996","unstructured":"Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson. Gadgets, approximation, and linear programming. In Proc. of 37th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 617\u2013626. IEEE Computer Society, Los Alamitos, 1996."},{"key":"22_CR8","unstructured":"Uri Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proc. Nineth Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 201\u2013210. ACM-SIAM, 1998."}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T00:00:54Z","timestamp":1550793654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}