{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:17Z","timestamp":1725575177106},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_71","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T16:14:27Z","timestamp":1295108067000},"page":"670-679","source":"Crossref","is-referenced-by-count":3,"title":["The Capacitated max-k-cut Problem"],"prefix":"10.1007","author":[{"given":"Daya Ram","family":"Gaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"71_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(99)00245-0","volume":"103","author":"M. Avriel","year":"2000","unstructured":"Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl. Math.\u00a0103(1-3), 271\u2013279 (2000)","journal-title":"Discrete Appl. Math."},{"key":"71_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1018956823693","volume":"76","author":"M. Avriel","year":"1998","unstructured":"Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research\u00a076, 55\u201371 (1998)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"71_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved approximation algorithms for max k-cut and max bisection. Algorithmica\u00a018(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"6","key":"71_CR4","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"71_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/380752.380838","volume-title":"Proceedings of the thirty-third annual ACM symposium on Theory of computing","author":"M. Goemans","year":"2001","unstructured":"Goemans, M., Williamson, D.: Approximation algorithms for max-3-cut and other problems via complex semidefinite programming. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 443\u2013452. ACM Press, New York (2001)"},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/S0097539796309326","volume":"5","author":"S. Mahajan","year":"1999","unstructured":"Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing\u00a05, 1641\u20131663 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"71_CR7","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"71_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM\u00a023, 555\u2013565 (1976)","journal-title":"Journal of the ACM"},{"key":"71_CR9","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:06:20Z","timestamp":1619507180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11424925_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}