{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T16:58:16Z","timestamp":1770483496604,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223399","type":"print"},{"value":"9783540278108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_27","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"311-322","source":"Crossref","is-referenced-by-count":6,"title":["Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling under resource constraints - deterministic models. Annals of Operations Research\u00a07 (1986)"},{"key":"27_CR2","volume-title":"Potential function methods for approximately solving linear programming problems: Theory and practive","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D.: Potential function methods for approximately solving linear programming problems: Theory and practive. Kluwer, Boston (2002)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/3-540-48224-5_60","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2001","unstructured":"Caragiannis, I., Ferreira, A., Kaklamanis, C., Perennes, S., Rivano, H.: Fractional path coloring with applications to WDM networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 732\u2013743. Springer, Heidelberg (2001)"},{"key":"27_CR4","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":"27_CR5","unstructured":"Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms SODA (2004)"},{"key":"27_CR6","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":"27_CR7","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":"27_CR8","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 pricedirective decomposition. Mathematics of Operations Research\u00a02, 321\u2013340 (1996)","journal-title":"Mathematics of Operations Research"},{"key":"27_CR9","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":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/3-540-45749-6_50","volume-title":"Algorithms - ESA 2002","author":"K. Jansen","year":"2002","unstructured":"Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 562\u2013573. Springer, Heidelberg (2002)"},{"key":"27_CR11","unstructured":"Jansen, K.: Improved approximation algorithms for the general max-min resource sharing and fractional covering problem (unpublished manuscript)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-47867-1_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Jansen","year":"2002","unstructured":"Jansen, K., Porkolab, L.: On preemptive resource constrained scheduling: polynomial-time approximation schemes. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 329\u2013349. Springer, Heidelberg (2002)"},{"key":"27_CR13","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 Publisher, Dordrecht (2002)"},{"key":"27_CR14","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., Remila, E.: Approximate strip packing. Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"27_CR15","unstructured":"K\u00f6nemann, J.: Fast combinatorial algorithms for packing and covering problems, Diploma Thesis, Max-Planck-Institute for Computer Science Saarbr\u00fccken (2000)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM\u00a022 (1975)522-550 , Errata, Journal of the ACM \u00a024, 527(1977)","DOI":"10.1145\/322017.322032"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Proceedings Symposium on Discrete and Compuational Geometry, 2000","author":"T. Matsui","year":"2000","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 194\u2013200. Springer, Heidelberg (2000)"},{"key":"27_CR18","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":"27_CR19","unstructured":"Schreinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley Interscience Series in Discrete Mathematics (1997)"},{"key":"27_CR20","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, Berlin (1997)"},{"key":"27_CR21","unstructured":"Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 170\u2013178 (1995)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings 42nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 538\u2013546 (2001)","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:51:46Z","timestamp":1740261106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}