{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:33:40Z","timestamp":1736400820611,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_19","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"207-218","source":"Crossref","is-referenced-by-count":1,"title":["Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem"],"prefix":"10.1007","author":[{"given":"Mihhail","family":"Aizatulin","sequence":"first","affiliation":[]},{"given":"Florian","family":"Diedrich","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Aizatulin, M., Diedrich, F., Jansen, K.: Experimental Results in Approximation of Max-Min Resouce Sharing, http:\/\/www.informatik.uni-kiel.de\/textasciitildefdi\/"},{"key":"19_CR2","volume-title":"Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer, Dordrecht (2002)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 379\u2013388 (1998)","DOI":"10.1109\/SFCS.1998.743488"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Garg, N., K\u00f6nemann, J.: Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"M.D. Grigoriadis","year":"1994","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization\u00a04, 86\u2013107 (1994)","journal-title":"SIAM Journal on Optimization"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"M.D. Grigoriadis","year":"1996","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research\u00a02, 321\u2013340 (1996)","journal-title":"Mathematics of Operations Research"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1137\/S1052623499358689","volume":"41","author":"M.D. Grigoriadis","year":"2001","unstructured":"Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization\u00a041, 1081\u20131091 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11671541_6","volume-title":"Efficient Approximation and Online Algorithms","author":"K. Jansen","year":"2006","unstructured":"Jansen, K.: Approximation algorithms for min-max and max-min resource sharing problems and applications. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol.\u00a03484, pp. 156\u2013202. Springer, Heidelberg (2006)"},{"key":"19_CR9","first-page":"255","volume-title":"Proceedings 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002","author":"K. Jansen","year":"2002","unstructured":"Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, pp. 255\u2013266. Kluwer, Dordrecht (2002)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings 23rd IEEE Symposium on Foundations of Computer Science, FOCS 1982, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., R\u00e9mila, E.: Approximate strip packing. Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"19_CR12","unstructured":"K\u00f6nemann, J.: Fast combinatorial algorithms for packing and covering problems, Diploma Thesis, Max-Planck-Institute for Computer Science Saarbr\u00fccken (2000)"},{"key":"19_CR13","volume-title":"Algorithms and Combinatorics","author":"B. Korte","year":"2000","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. In: Algorithms and Combinatorics, vol.\u00a02, Springer, Heidelberg (2000)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11427186_15","volume-title":"Experimental and Efficient Algorithms","author":"Q. Lu","year":"2005","unstructured":"Lu, Q., Zhang, H.: Implementation of Approximation Algorithms for the Multicast Congestion Problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 152\u2013164. Springer, Heidelberg (2005)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research\u00a020, 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"19_CR16","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-59179-2_23","volume-title":"Network Optimization","author":"J. Villavicencio","year":"1997","unstructured":"Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W., Hager, W.W. (eds.) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0450, pp. 471\u2013485. Springer, Heidelberg (1997)"},{"key":"19_CR17","unstructured":"Young, N.E.: Randomized rounding without solving the linear program. In: Young, N.E. (ed.) Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 170\u2013178 (1995)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T00:50:35Z","timestamp":1736383835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11764298_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}