{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:33Z","timestamp":1725586833473},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_28","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"349-361","source":"Crossref","is-referenced-by-count":7,"title":["Iterative Packing for Demand and Hypergraph Matching"],"prefix":"10.1007","author":[{"given":"Ojas","family":"Parekh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-13036-6_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"N. Bansal","year":"2010","unstructured":"Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: On k-column sparse packing programs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 369\u2013382. Springer, Heidelberg (2010)"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput.\u00a036(1), 1\u201315 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.10033","volume":"20","author":"R.D. Carr","year":"2002","unstructured":"Carr, R.D., Vempala, S.: Randomized metarounding. Random Struct. Algorithms\u00a020(3), 343\u2013352 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"28_CR4","first-page":"1500","volume-title":"SODA","author":"Y.H. Chan","year":"2010","unstructured":"Chan, Y.H., Lau, L.C.: On linear and semidefinite programming relaxations for hypergraph matching. In: Charikar, M. (ed.) SODA, pp. 1500\u20131511. SIAM, Philadelphia (2010)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-03685-9_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Chekuri","year":"2009","unstructured":"Chekuri, C., Ene, A., Korula, N.: Unsplittable flow in paths and trees and column-restricted packing integer programs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 42\u201355. Springer, Heidelberg (2009)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273343"},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01303202","volume":"13","author":"Z. F\u00fcredi","year":"1993","unstructured":"F\u00fcredi, Z., Kahn, J., Seymour, P.D.: On the fractional matching polytope of a hypergraph. Combinatorica\u00a013(2), 167\u2013180 (1993)","journal-title":"Combinatorica"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating -set packing. Computational Complexity\u00a015(1), 20\u201339 (2006)","journal-title":"Computational Complexity"},{"key":"28_CR9","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 algorithm for the generalized Steiner network problem. Combinatorica\u00a021, 39\u201360 (2001)","journal-title":"Combinatorica"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10107-002-0370-6","volume":"99","author":"S.G. Kolliopoulos","year":"2004","unstructured":"Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using packing integer programs. Mathematical Programming\u00a099(1), 63\u201387 (2004)","journal-title":"Mathematical Programming"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-04355-0_23","volume-title":"Distributed Computing","author":"C. Koufogiannakis","year":"2009","unstructured":"Koufogiannakis, C., Young, N.E.: Distributed fractional packing and maximum weighted b-matching via tail-recursive duality. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 221\u2013238. Springer, Heidelberg (2009)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/11549345_53","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Krysta","year":"2005","unstructured":"Krysta, P.: Greedy approximation via duality for packing, combinatorial auctions and routing. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 615\u2013627. Springer, Heidelberg (2005)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-04128-0_8","volume-title":"Algorithms - ESA 2009","author":"D. Pritchard","year":"2009","unstructured":"Pritchard, D.: Approximability of sparse integer programs. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 83\u201394. Springer, Heidelberg (2009)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Pritchard, D., Chakrabarty, D.: Approximability of sparse integer programs (2010) (to appear in Algorithmica) 19 p.","DOI":"10.1007\/s00453-010-9431-z"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/moor.1070.0254","volume":"32","author":"F.B. Shepherd","year":"2007","unstructured":"Shepherd, F.B., Vetta, A.: The demand-matching problem. Mathematics of Operations Research\u00a032(3), 563\u2013578 (2007)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1145\/1250790.1250887","volume-title":"STOC","author":"M. Singh","year":"2007","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 661\u2013670. ACM, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T13:41:57Z","timestamp":1686145317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}