{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:06:24Z","timestamp":1746158784799,"version":"3.40.4"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781475752755"},{"type":"electronic","value":"9780387356082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-0-387-35608-2_22","type":"book-chapter","created":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T21:57:25Z","timestamp":1388354245000},"page":"255-266","source":"Crossref","is-referenced-by-count":16,"title":["Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"M. Charikar, C. Chekuri, A. Goel, S. Guha and S. Plotkin, Approximating a finite metric by a small number of tree metrics, Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, 379\u2013388.","DOI":"10.1109\/SFCS.1998.743488"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1137\/S0097539796308217","volume":"6","author":"G Even","year":"1999","unstructured":"G. Even, J. S. Naor, S. Rao and B. Schieber, Fast approximate graph partitioning algorithms, SIAM Journal on Computing, 6 (1999), 2187\u20132214.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"N. Garg and J. K\u00f6nemann, Fast and simpler algorithms for multicommodity flow and other fractional packing problems, Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, 300\u2013309.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"MD Grigoriadis","year":"1994","unstructured":"M. D. Grigoriadis and L. G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM Journal on Optimization, 4 (1994), 86\u2013107.","journal-title":"SIAM Journal on Optimization"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"MD Grigoriadis","year":"1996","unstructured":"M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research, 2 (1996), 321\u2013340.","journal-title":"Mathematics of Operations Research"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1137\/S1052623499358689","volume":"11","author":"MD Grigoriadis","year":"2001","unstructured":"M. D. Grigoriadis, L. G. Khachiyan, L. Porkolab and J. Villavicencio, Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, 11 (2001), 1081\u20131091.","journal-title":"SIAM Journal on Optimization"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"K. Jansen, Approximation algorithms for fractional covering and packing problems, and applications, Manuscript, (2001).","DOI":"10.1007\/3-540-44669-9_2"},{"key":"22_CR8","volume-title":"Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization","author":"K Jansen","year":"2002","unstructured":"K. Jansen and L. Porkolab, On preemptive resource constrained scheduling: polynomial-time approximation schemes, Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, IPCO 2002."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"24","author":"JK Lenstra","year":"1990","unstructured":"J. K. Lenstra, D. B. Shmoys and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, 24 (1990), 259\u2013272.","journal-title":"Mathematical Programming"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"2","author":"SA Plotkin","year":"1995","unstructured":"S. A. Plotkin, D. B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 2 (1995), 257\u2013301.","journal-title":"Mathematics of Operations Research"},{"key":"22_CR11","first-page":"471","volume-title":"Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential","author":"J Villavicencio","year":"1997","unstructured":"J. Villavicencio and M. D. Grigoriadis, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, Network Optimization, P. Pardalos, D. W. Hearn and W. W. Hager, Eds, Lecture Notes in Economics and Mathematical Systems 450, SpringerVerlag, Berlin, (1997), 471\u2013485."},{"key":"22_CR12","unstructured":"N. E. Young, Randomized rounding without solving the linear program, Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, 170\u2013178."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"N. E. Young, Sequential and parallel algorithms for mixed packing and covering, Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 538\u2013546.","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Foundations of Information Technology in the Era of Network and Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35608-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T09:51:09Z","timestamp":1746093069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35608-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781475752755","9780387356082"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35608-2_22","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}