{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:41:33Z","timestamp":1743100893591,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_53","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"625-636","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for Bounded Color Matchings via Convex Decompositions"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Stamoulis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"53_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/net.20425","volume":"57","author":"E. Bampas","year":"2011","unstructured":"Bampas, E., Pagourtzis, A., Potika, K.: An experimental study of maximum profit wavelength assignment in wdm rings. Networks\u00a057(3), 285\u2013293 (2011)","journal-title":"Networks"},{"key":"53_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-68891-4_19","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Berger","year":"2008","unstructured":"Berger, A., Bonifaci, V., Grandoni, F., Sch\u00e4fer, G.: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 273\u2013287. Springer, Heidelberg (2008)"},{"key":"53_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-44985-X_19","volume-title":"Algorithm Theory - SWAT 2000","author":"P. Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 214\u2013219. Springer, Heidelberg (2000)"},{"issue":"2","key":"53_CR4","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/06067660X","volume":"23","author":"I. Caragiannis","year":"2009","unstructured":"Caragiannis, I.: Wavelength management in wdm rings to maximize the number of connections. SIAM J. Discrete Math.\u00a023(2), 959\u2013978 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"53_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF03014795","volume":"32","author":"C. Carath\u00e9odory","year":"1911","unstructured":"Carath\u00e9odory, C.: \u00dcber den variabilit\u00e4tsbereich der fourierschen konstanten von positiven harmonischen funktionen. Rendiconti del Circolo Matematico di Palermo\u00a032, 193\u2013217 (1911)","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"issue":"1-2","key":"53_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-011-0451-5","volume":"135","author":"Y.H. Chan","year":"2012","unstructured":"Chan, Y.H., Lau, L.C.: On linear and semidefinite programming relaxations for hypergraph matching. Math. Program.\u00a0135(1-2), 123\u2013148 (2012)","journal-title":"Math. Program."},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding. In: SODA, pp. 1080\u20131097 (2011)","DOI":"10.1137\/1.9781611973082.82"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1 vertices. J. of Res. the Nat. Bureau of Standards\u00a069B, 125\u2013130 (1965)","journal-title":"J. of Res. the Nat. Bureau of Standards"},{"key":"53_CR9","unstructured":"F\u00fcrer, M., Yu, H.: Approximate the k-set packing problem by local improvements. In: ISCO-3rd International Symbosium on Combinatorial Optimization, Lisboa, Portugal, March 5-7, Lisboa, Portugal, March 5-7 (2014)"},{"key":"53_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"53_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-04128-0_9","volume-title":"Algorithms - ESA 2009","author":"F. Grandoni","year":"2009","unstructured":"Grandoni, F., Ravi, R., Singh, M.: Iterative rounding for multi-objective optimization problems. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"53_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-15775-2_46","volume-title":"Algorithms \u2013 ESA 2010","author":"F. Grandoni","year":"2010","unstructured":"Grandoni, F., Zenklusen, R.: Approximation schemes for multi-budgeted independence systems. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 536\u2013548. Springer, Heidelberg (2010)"},{"key":"53_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-32147-4_31","volume-title":"Combinatorial Optimization","author":"M. Mastrolilli","year":"2012","unstructured":"Mastrolilli, M., Stamoulis, G.: Constrained matching problems in bipartite graphs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol.\u00a07422, pp. 344\u2013355. Springer, Heidelberg (2012)"},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2013.11.027","volume":"540-541","author":"M. Mastrolilli","year":"2014","unstructured":"Mastrolilli, M., Stamoulis, G.: Bi-criteria approximation algorithms for restricted matchings. Theoretical Computer Science\u00a0540-541, 115\u2013132 (2014)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"53_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ipl.2005.06.009","volume":"96","author":"J. Monnot","year":"2005","unstructured":"Monnot, J.: The labeled perfect matching in bipartite graphs. Inf. Process. Lett.\u00a096(3), 81\u201388 (2005)","journal-title":"Inf. Process. Lett."},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208971"},{"key":"53_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-540-74456-6_63","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C. Nomikos","year":"2007","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Randomized and approximation algorithms for blue-red matching. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 715\u2013725. Springer, Heidelberg (2007)"},{"issue":"2","key":"53_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted spanning tree problems. J. ACM\u00a029(2), 285\u2013309 (1982)","journal-title":"J. ACM"},{"key":"53_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-20807-2_28","volume-title":"Integer Programming and Combinatoral Optimization","author":"O. Parekh","year":"2011","unstructured":"Parekh, O.: Iterative packing for demand and hypergraph matching. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 349\u2013361. Springer, Heidelberg (2011)"},{"issue":"1-2","key":"53_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00453-011-9519-0","volume":"63","author":"R. Yuster","year":"2012","unstructured":"Yuster, R.: Almost exact matchings. Algorithmica\u00a063(1-2), 39\u201350 (2012)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T20:17:38Z","timestamp":1676405858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}