{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:32:44Z","timestamp":1767137564512,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_5","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"50-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Graph Partitioning Problems Arising in Tagless Cache Management"],"prefix":"10.1007","author":[{"given":"Sandro","family":"Bartolini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iacopo","family":"Casini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Detti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.disopt.2006.05.009","volume":"3","author":"A Alfieri","year":"2006","unstructured":"Alfieri, A., Nicosia, G., Pacifici, A.: Exact algorithms for a discrete metric labeling problem. Discrete Optim. 3(3), 181\u2013194 (2006)","journal-title":"Discrete Optim."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"CJ Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. Integr. VLSI J. 19, 1\u201381 (1995)","journal-title":"Integr. VLSI J."},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Grotschel","year":"1989","unstructured":"Grotschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1), 59\u201396 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02592198","volume":"74","author":"CE Ferreira","year":"1996","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74(3), 247\u2013266 (1996)","journal-title":"Math. Program."},{"key":"5_CR5","first-page":"229","volume":"81","author":"CE Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Prog. Series B 81, 229\u2013256 (1998)","journal-title":"Math. Prog. Series B"},{"key":"5_CR6","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman and co., New York (1979)"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01783411","volume":"15","author":"S Holm","year":"1993","unstructured":"Holm, S., Sorensen, M.M.: The optimal graph partitioning problem. OR Spectrum 15(1), 1\u20138 (1993)","journal-title":"OR Spectrum"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Jones, T.M., Bartolini, S., Maebe, J., Chanet, D.: Link-time optimization for power efficiency in a tagless instruction cache. In: 2011 9th Annual IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 32\u201341 (2011)","DOI":"10.1109\/CGO.2011.5764672"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22, 1\u201312 (1998)","journal-title":"Oper. Res. Lett."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cor.2013.08.013","volume":"41","author":"J Nossack","year":"2014","unstructured":"Nossack, J., Pesch, E.: A branch-and-bound algorithm for the acyclic problem. Comput. OR 41, 174\u2013184 (2014)","journal-title":"Comput. OR"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"WA Wulf","year":"1995","unstructured":"Wulf, W.A., McKee, S.A.: Hitting the memory wall: Implications of the obvious. SIGARCH Comput. Archit. News 23(1), 20\u201324 (1995)","journal-title":"SIGARCH Comput. Archit. News"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:09:06Z","timestamp":1703192946000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":11,"aliases":["10.1007\/978-3-319-14115-2_5"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}