{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:28Z","timestamp":1725664048228},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992]]},"DOI":"10.1007\/3-540-56279-6_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:57:29Z","timestamp":1330235849000},"page":"97-105","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for a class of Min-Cut and Max-Cut problem"],"prefix":"10.1007","author":[{"given":"Teofilo F.","family":"Gonzalez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshio","family":"Murayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, \u201cLower Bounds for Algebraic Computation Trees,\u201d Proc. 15th ACM Annual Symposium on Theory of Computing 80\u201386, 1983.","DOI":"10.1145\/800061.808735"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0205015","volume":"15","author":"D. Dobkin","year":"1976","unstructured":"D. Dobkin, and R. Lipton, \u201cMultidimensional Searching Problems,\u201d SIAM Journal on Computing, 15(2), 181\u2013186, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"M. R. Garey, D. S. Johnson, and L. Stockmeyer, \u201cSome Simplified NP-Complete Graph Problems,\u201d Theoretical Computer Science, (1), 237\u2013267, 1976.","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"11_CR4","unstructured":"M. R. Garey and D. S. Johnson, \u201cComputers and Intractability,\u201d Freeman, 1980."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"A. George","year":"1978","unstructured":"A. George and J. W. H. Liu, \u201cAn automatic nested dissection algorithm for irregular finite element problems,\u201d SIAM Journal on Numerical Analysis, 15, 1053\u20131069, 1978.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"11_CR6","unstructured":"J. R. Gilbert and E. Zmijewski, \u201cCombinatorial Sparse Matrix Theory,\u201d Chapter 5, Lecture Notes in Computer Science, UCSB, 1991."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. F. Gonzalez","year":"1985","unstructured":"T. F. Gonzalez, \u201cClustering to Minimize the Maximum Intercluster Distance,\u201d Theoretical Computer Science, 38, 293\u2013306, 1985.","journal-title":"Theoretical Computer Science"},{"key":"11_CR8","unstructured":"E. Horowitz and S. Sahni, \u201cFundamentals of Computer Algorithms,\u201d Computer Science Press, 1978."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin, \u201cAn Efficient Heuristic Procedure for Partitioning Graphs,\u201d The Bell System Technical Journal, 49, 291\u2013307, 1970.","journal-title":"The Bell System Technical Journal"},{"issue":"33","key":"11_CR10","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"C","author":"B. Krishnamurthy","year":"1984","unstructured":"B. Krishnamurthy, \u201cAn improved min-cut algorithm for partition VLSI networks,\u201d IEEE Transactions on Computers, C(33), 438\u2013446, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR11","volume-title":"M.S. Thesis","author":"T. Murayama","year":"1991","unstructured":"T. Murayama, \u201cAlgorithmic Issues for the Min-Cut and Max-Cut Problems,\u201d M.S. Thesis, Department of Computer Science, The University of California, Santa Barbara, December 1991."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"D. F. Wong, H. W. Leong, and C. L. Liu, \u201cSimulated Annealing for VLSI Design,\u201d Kluwer Academic Publishers, 1988.","DOI":"10.1007\/978-1-4613-1677-0"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:44:47Z","timestamp":1558255487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}