{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:15:37Z","timestamp":1740287737049,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_7","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"81-96","source":"Crossref","is-referenced-by-count":12,"title":["Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Fabi\u00e1n A.","family":"Chudak","sequence":"first","affiliation":[]},{"given":"V\u00e2nia","family":"Eleut\u00e9rio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M.L. Balinski","year":"1965","unstructured":"Balinski, M.L.: Integer programming: methods, uses, computation. Management Science\u00a012(3), 253\u2013313 (1965)","journal-title":"Management Science"},{"key":"7_CR3","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with the subgradient method. Technical report, IBM Watson (1998)"},{"key":"7_CR4","volume-title":"Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems","author":"F. Barahona","year":"1999","unstructured":"Barahona, F., Chudak, F.: Solving large scale uncapacitated facility location problems. In: Pardalos, P.M. (ed.) Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer Acad. Publ., Dordrecht (1999)"},{"key":"7_CR5","unstructured":"Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. U. Catholique de Louvain, Belgium. CORE Lecture Series (2001) ISSN-0771 3894"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Iyengar, G.: Solving fractional packing problems in $o^*(\\frac{1}{\\epsilon})$ iterations. In: STOC 2004, pp. 146\u2013155 (2004)","DOI":"10.1145\/1007352.1007382"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chudak, F.: A simple approximation scheme for the linear programming relaxation of the uncapacitated facility location problem based on a recent algorithm of Garg and Khandekar. Manuscript (2003)","DOI":"10.1137\/S0097539703405754"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F.A. Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput.\u00a033(1), 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"7_CR9","unstructured":"Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: SODA 2004, pp. 1001\u20131010 (2004)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Garg, N., Khandekar, R.: Fast approximation algorithms for fractional steiner forest and related problems. In: FOCS 2002, pp. 500\u2013509 (2002)","DOI":"10.1109\/SFCS.2002.1181974"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: FOCS 1998, pp. 300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"issue":"21","key":"7_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation for the generalized steiner network problem. Combinatorica\u00a021(21), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"7_CR13","unstructured":"Khandekar, R.: Lagrangian Relaxation Based Algorithms for Convex Programming Problems. PhD thesis, Indian Institute of Technology Delhi (2004)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-48777-8_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Klein","year":"1999","unstructured":"Klein, P., Young, N.: On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 320\u2013327. Springer, Heidelberg (1999)"},{"key":"7_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial Optimization : Theory and Algorithms","author":"B. Korte","year":"2000","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2000)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: \u03b5-approximation with minimum packing constraint violation. In: STOC 1992, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0377-2217(84)90160-7","volume":"18","author":"M. Minoux","year":"1984","unstructured":"Minoux, M.: A polynomial algorithm for minimum quadratic cost flows. European J. Oper. Res.\u00a018, 377\u2013387 (1984)","journal-title":"European J. Oper. Res."},{"key":"7_CR18","volume-title":"Discrete Location Theory","author":"P. Mirchandani","year":"1990","unstructured":"Mirchandani, P., Francis, R.: Discrete Location Theory. John Wiley and Sons, Inc., New York (1990)"},{"key":"7_CR19","unstructured":"Nesterov, Y.: Excessive gap technique in non-smooth convex minimizarion. SIAM J. Optimization (2003) (to appear)"},{"key":"7_CR20","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y.. Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Mathematcal Programming (2003) (to appear)","DOI":"10.1007\/s10107-004-0552-5"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Unconstrained convex minimization in relative scale. Technical report, CORE (2003)","DOI":"10.2139\/ssrn.981384"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Rounding of convex sets and efficient gradient methods for linear programming problems. Technical report, CORE (2004)","DOI":"10.2139\/ssrn.965658"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Mathematical Programming\u00a062, 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"key":"7_CR25","unstructured":"Young, N.: K-medians, facility location, and the chernoff-wald bound. In: STOC 2000, pp. 86\u201395 (2000)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: FOCS 2001, pp. 538\u2013546 (2001)","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:24:21Z","timestamp":1740263061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11496915_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}