{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:41Z","timestamp":1725484301272},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540436768"},{"type":"electronic","value":"9783540478676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_32","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:47:17Z","timestamp":1179946037000},"page":"457-474","source":"Crossref","is-referenced-by-count":6,"title":["The Demand Matching Problem"],"prefix":"10.1007","author":[{"given":"Bruce","family":"Shepherd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"32_CR1","unstructured":"R. Ahuja, T. Magnanti and J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"P. Berman and M. Karpinksi, \u201cOn some tighter inapproximability results\u201d, Proc. 26 th Int. Coll. on Automota, Languages, and Programming, pp200\u2013209, 1999.","DOI":"10.1007\/3-540-48523-6_17"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"A. Chakrabarti, C. Chekuri, A. Gupta and A. Kumar, \u201cApproximation algorithms for the unsplittable flow problem\u201d, manuscript, September 2001.","DOI":"10.1007\/3-540-45753-4_7"},{"key":"32_CR4","unstructured":"C. Chekuri and S. Khanna, \u201cA PTAS for the Multiple Knapsack Problem\u201d, Proc. 11th SODA, 2000."},{"key":"32_CR5","unstructured":"C. Chekuri, Personal Communication, November 2000."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s004930050043","volume":"19","author":"Y. Dinitz","year":"1999","unstructured":"Y. Dinitz, N. Garg and M. Goemans, \u201cOn the Single-Source Unsplittable Flow Problem\u201d, Combinatorica, 19, pp17\u201341, 1999.","journal-title":"Combinatorica"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0, 1-vertices\u201d, Journal of Research of the Natuional Bureau of Standards (B), 69, pp125\u201330, 1965.","journal-title":"Journal of Research of the Natuional Bureau of Standards (B)"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"N. Garg, V.V. Vazirani and M. Yannakakis, \u201cPrimal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees with Applications to Matching and Set Cover\u201d, Algorithmica 18, pp3\u201320, 1997.","journal-title":"Algorithmica"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"A.J. Hoffman and J.B. Kruskal, \u201cIntegral boundary points of convex polyhedra\u201d, in H.W. Kuhn and A.W. Tucker eds., Linear Inequalities and Related Systems, Princeton University Press, pp223\u2013246, 1956.","DOI":"10.1515\/9781400881987-014"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"O.H. Ibarra and C.E. Kim, \u201cFast approximation for the knapsack and sum of subset problems\u201d, Journal of the ACM, 22, pp463\u2013468, 1975.","journal-title":"Journal of the ACM"},{"key":"32_CR11","unstructured":"C.H. Papadimitriou, Computational Complexity, Addison Wesley, 1994."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D. Shmoys","year":"1993","unstructured":"D. Shmoys and \u00c9. Tardos, \u201cAn approximation algorithm for the generalized assignment problem\u201d, Mathematical Programming A, 62, pp461\u2013474, 1993.","journal-title":"Mathematical Programming A"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"L. Trevisan, \u201cNon-approximability Results for Optimization Problems on Bounded Degree Instances\u201d, Proc. 33rd STOC, 2001.","DOI":"10.1145\/380752.380839"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T07:52:37Z","timestamp":1587541957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-47867-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}