{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:03:57Z","timestamp":1725563037291},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_5","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"53-66","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Min-Max Generalization Problems"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofya","family":"Raskhodnikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Du, W., Eppstein, D., Goodrich, M.T., Lueker, G.S.: On the approximability of geometric and geographic generalization and the min-max bin covering problem. In: WADS, pp. 242\u2013253 (2009)","DOI":"10.1007\/978-3-642-03367-4_22"},{"key":"5_CR2","volume-title":"Privacy-Preserving Data Mining: Models and Algorithms","author":"V. Ciriani","year":"2008","unstructured":"Ciriani, V., di Vimercati, S.D.C., Foresti, S., Samarati, P.: k-anonymous data mining: A survey. In: Aggarwal, C.C., Yu, P.S. (eds.) Privacy-Preserving Data Mining: Models and Algorithms, Springer, Heidelberg (2008)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/288692.288723","volume-title":"GIS 1998: Proceedings of the 1998 ACM Int. Symp. on Advances in Geographic Information Systems","author":"Y.J. Garcia","year":"1998","unstructured":"Garcia, Y.J., Lopez, M.A., Leutenegger, S.T.: A greedy algorithm for bulk loading r-trees. In: GIS 1998: Proceedings of the 1998 ACM Int. Symp. on Advances in Geographic Information Systems, pp. 163\u2013164. ACM, New York (1998)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S.F. Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms\u00a05(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"key":"5_CR5","unstructured":"Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: SODA, pp. 557\u2013566 (2001)"},{"issue":"1-3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","volume":"306","author":"K. Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci.\u00a0306(1-3), 543\u2013551 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1132516.1132522","volume-title":"STOC 2006: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., Sviridenko, M.: The santa claus problem. In: STOC 2006: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 31\u201340. ACM, New York (2006)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"5_CR9","unstructured":"Manne, F.: Load Balancing in Parallel Sparse Matrix Computation. PhD thesis, University of Bergen, Norway (1993)"},{"key":"5_CR10","unstructured":"Khanna, S., Muthukrishnan, S., Paterson, M.: On approximating rectangle tiling and packing. In: SODA, pp. 384\u2013393 (1998)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-48321-7_42","volume-title":"Fundamentals of Computation Theory","author":"J.P. Sharp","year":"1999","unstructured":"Sharp, J.P.: Tiling multi-dimensional arrays. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 500\u2013511. Springer, Heidelberg (1999)"},{"key":"5_CR12","unstructured":"Smith, A., Suri, S.: Rectangular tiling in multi-dimensional arrays. In: SODA, pp. 786\u2013794 (1999)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-49257-7_16","volume-title":"Database Theory - ICDT\u201999","author":"S. Muthukrishnan","year":"1998","unstructured":"Muthukrishnan, S., Poosala, V., Suel, T.: On rectangular partitionings in two dimensions: Algorithms, complexity, and applications. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 236\u2013256. Springer, Heidelberg (1998)"},{"key":"5_CR14","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Improved approximation algorithms for rectangle tiling and packing. In: SODA, pp. 427\u2013436 (2001)"},{"key":"5_CR15","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Slice and dice: A simple, improved approximate tiling recipe. In: SODA, pp. 455\u2013464 (2002)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0196-6774(03)00015-4","volume":"47","author":"P. Berman","year":"2003","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Approximation algorithms for max-min tiling. J. Algorithms\u00a047(2), 122\u2013134 (2003)","journal-title":"J. Algorithms"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program.\u00a046(3), 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"W.T. Tutte","year":"1956","unstructured":"Tutte, W.T.: A theorem on planar graphs. Trans. Amer. Math. Soc.\u00a082, 99\u2013116 (1956)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N. Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. J. Algorithms\u00a010(2), 187\u2013211 (1989)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:33Z","timestamp":1606187133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}