{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:10:31Z","timestamp":1736284231954,"version":"3.32.0"},"publisher-location":"Boston","reference-count":17,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_19","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"223-236","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Mixed Fractional Packing and Covering Problems"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Potential function methods for approximately solving linear programming problems: Theory and practive","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D. (2002). Potential function methods for approximately solving linear programming problems: Theory and practive. Boston: Kluwer."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., and Plotkin, S. A. (1998). Approximating a finite metric by a small number of tree metrics, Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 379\u2013388.","DOI":"10.1109\/SFCS.1998.743488"},{"key":"19_CR3","first-page":"732","volume":"2076","author":"I. Caragiannis","year":"2001","unstructured":"Caragiannis, I., Ferreira, A., Kaklamanis, C., Perennes, S., and Rivano, H. (2001). Frac tional path coloring with applications to WDM networks, Proceedings 28th International Colloquium on Automata, Languages, and Programming, IC ALP 2001, LNCS 2076, 732\u2013743.","journal-title":"LNCS"},{"key":"19_CR4","unstructured":"Fleischer, L. (2004). A fast approximation scheme for fractional covering problems with variable upper bounds, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algo rithms, SODA 2004."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Garg, N. and K\u00f6nemann, J. (1998). 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":"19_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"M.D. Grigoriadis","year":"1994","unstructured":"Grigoriadis, M.D. and Khachiyan, L.G. (1994). Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM Journal on Optimization, 4: 86\u2013107.","journal-title":"SIAM Journal on Optimization"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"M.D. Grigoriadis","year":"1996","unstructured":"Grigoriadis, M.D. and Khachiyan, L.G. (1996). Coordination complexity of parallel price directive decomposition, Mathematics of Operations Research, 2: 321\u2013340.","journal-title":"Mathematics of Operations Research"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1137\/S1052623499358689","volume":"41","author":"M.D. Grigoriadis","year":"2001","unstructured":"Grigoriadis, M.D., Khachiyan, L.G., Porkolab, L., and Villavicencio, J. (2001). Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, 41: 1081\u20131091.","journal-title":"SIAM Journal on Optimization"},{"key":"19_CR9","first-page":"329","volume":"2337","author":"K. Jansen","year":"2002","unstructured":"Jansen, K. and Porkolab, L. (2002). On preemptive resource constrained scheduling: polynomial-time approximation schemes, Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, LNCS 2337, 329\u2013349.","journal-title":"LNCS"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K. and Zhang, H. (2002) Approximation algorithms for general packing problems with modified logarithmic potential function, Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, Foundations of information technology in the era of network and mobile computing, Kluwer Academic Publisher, 2002, 255\u2013266.","DOI":"10.1007\/978-0-387-35608-2_22"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, K. (2004). Approximation algorithms for the general max-min resource sharing problem: faster and simpler, to appear in: Proceedings of the 9th Scandinavian Workshopon Algorithm Theory, SWAT 2004.","DOI":"10.1007\/978-3-540-27810-8_27"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Kenyon, C. and E. Remila, E. (1996). Approximate strip packing, Proceedings 37th IEEE Symposium on Foundations of Computer Science, FOCS 1996, 31\u201336.","DOI":"10.1109\/SFCS.1996.548461"},{"key":"19_CR13","volume-title":"Diploma Thesis","author":"J. K\u00f6nemann","year":"2000","unstructured":"K\u00f6nemann, J, (2000). Fast combinatorial algorithms for packing and covering problems, Diploma Thesis, Max-Planck-Institute for Computer Science Saarbr\u00fccken."},{"key":"19_CR14","doi-asserted-by":"crossref","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., and Tardos, E. (1995). Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research, 20: 257\u2013301.","journal-title":"Mathematics of Operations Research"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-59179-2_23","volume":"450","author":"J. Villavicencio","year":"1997","unstructured":"Villavicencio, J. and Grigoriadis, M.D. (1997). Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, Network Optimization, Lecture Notes in Economics and Mathematical Systems, 450: 471\u2013485.","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"key":"19_CR16","unstructured":"Young, N.E. (1995). Randomized rounding without solving the linear program, Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms SODA 1995, 170\u2013178."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Young, N.E. (2001). Sequential and parallel algorithms for mixed packing and covering, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2001, 538\u2013546.","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:45:25Z","timestamp":1736282725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_19","relation":{},"subject":[]}}