{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:17:08Z","timestamp":1781345828961,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s12532-011-0023-y","type":"journal-article","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T18:20:18Z","timestamp":1299003618000},"page":"1-35","source":"Crossref","is-referenced-by-count":27,"title":["Faster min\u2013max resource sharing in theory and practice"],"prefix":"10.1007","volume":"3","author":[{"given":"Dirk","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"Radke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,3,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1109\/43.920691","volume":"20","author":"C. Albrecht","year":"2001","unstructured":"Albrecht C.: Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20, 622\u2013632 (2001)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"23_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 Academic Publishers, Norwell (2002)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1137\/S0097539705447293","volume":"35","author":"D. Bienstock","year":"2006","unstructured":"Bienstock D., Iyengar G.: Approximating fractional packings and coverings in $${O(\\frac{1}{\\epsilon})}$$ iterations. SIAM J. Comput. 35, 825\u2013854 (2006)","journal-title":"SIAM J. Comput."},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/43.486666","volume":"15","author":"R.C. Carden IV","year":"1996","unstructured":"Carden R.C. IV, Li J., Cheng C.-K.: A global router with a theoretical bound on the optimum solution. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15, 208\u2013216 (1996)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., and Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 379\u2013388 (1998)","DOI":"10.1109\/SFCS.1998.743488"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"L.K. Fleischer","year":"2000","unstructured":"Fleischer L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discret. Math. 13, 505\u2013520 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1137\/S0097539704446232","volume":"37","author":"N. Garg","year":"2007","unstructured":"Garg N., K\u00f6nemann J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37, 630\u2013652 (2007)","journal-title":"SIAM J. Comput."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"M.D. Grigoriadis","year":"1994","unstructured":"Grigoriadis M.D., Khachiyan L.D.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4, 86\u2013107 (1994)","journal-title":"SIAM J. Optim."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"21","author":"M.D. Grigoriadis","year":"1996","unstructured":"Grigoriadis M.D., Khachiyan L.D.: Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21, 321\u2013340 (1996)","journal-title":"Math. Oper. Res."},{"key":"23_CR10","volume-title":"Computer Architecture: A Quantitative Approach","author":"J.L. Hennessy","year":"2007","unstructured":"Hennessy J.L., Patterson D.A.: Computer Architecture: A Quantitative Approach, 4th edn. Morgan Kaufmann, San Francisco (2007)","edition":"4"},{"key":"23_CR11","unstructured":"IEEE Standard for Binary Floating-Point Arithmetic. ANSI\/IEEE Std 754\u20132008, IEEE (2008)"},{"key":"23_CR12","unstructured":"Intel\u00ae64 and IA-32 Architectures Software Developer\u2019s Manual, vol. 3A, rev. 037, order number 253668-037US, January 2011. http:\/\/www.intel.com"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-007-0106-8","volume":"114","author":"K. Jansen","year":"2008","unstructured":"Jansen K., Zhang H.: Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math. Program. A 114, 183\u2013206 (2008)","journal-title":"Math. Program. A"},{"key":"23_CR14","unstructured":"Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology, Delhi (2004)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"M\u00fcller, D.: Optimizing yield in global routing. In: Proceedings of the IEEE International Conference on Computer-Aided Design, 480\u2013486 (2006)","DOI":"10.1109\/ICCAD.2006.320161"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Owens, S., Sarkar, S., Sewell, P.: A Better x86 Memory Model: x86-TSO. In: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics; LNCS 5674, pp. 391\u2013407. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03359-9_27"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"2","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin S.A., Shmoys D.B., Tardos \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 2, 257\u2013301 (1995)","journal-title":"Math. Oper. Res."},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37, 130\u2013143 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan P., Thompson C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"23_CR20","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"Shahrokhi F., Matula D.W.: The maximum concurrent flow problem. J. ACM 37, 318\u2013334 (1990)","journal-title":"J. ACM"},{"key":"23_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-99789-1_25","volume-title":"Applied Mathematics and Parallel Computing","author":"J. Villavicencio","year":"1996","unstructured":"Villavicencio J., Grigoriadis M.D.: Approximate structured optimization by cyclic block-coordinate descent. In: Fischer, H., Riedm\u00fcller, B., Sch\u00e4ffler, S. (eds) Applied Mathematics and Parallel Computing, pp. 359\u2013371. Physica-Verlag, Heidelberg (1996)"},{"key":"23_CR22","first-page":"308","volume-title":"Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064","author":"J. Vygen","year":"2004","unstructured":"Vygen J.: Near-optimum global routing with coupling, delay bounds, and power consumption. In: Nemhauser, G., Bienstock, D. (eds) Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064, pp. 308\u2013324. Springer, Berlin (2004)"},{"key":"23_CR23","unstructured":"Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 170\u2013178 (1995)"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 538\u2013546 (2001)","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0023-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-011-0023-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0023-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T02:18:39Z","timestamp":1740968319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-011-0023-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s12532-011-0023-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}