{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T10:40:21Z","timestamp":1737369621669,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_63","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"715-725","source":"Crossref","is-referenced-by-count":6,"title":["Randomized and Approximation Algorithms for Blue-Red Matching"],"prefix":"10.1007","author":[{"given":"Christos","family":"Nomikos","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70918-3_6","volume-title":"STACS 2007","author":"I. Caragiannis","year":"2007","unstructured":"Caragiannis, I.: Wavelength Management in WDM Rings to Maximize the Number of Connections. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 61\u201372. Springer, Heidelberg (2007)"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-Coloring of Intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"63_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The Complexity of Path Coloring and Call Scheduling. Theoretical Computer Science\u00a0255(1-2), 33\u201350 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"63_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0166-218X(92)00034-J","volume":"51","author":"G. Galbiati","year":"1994","unstructured":"Galbiati, G., Maffioli, F.: On the Computation of Pfaffians. Discrete Applied Mathematics\u00a051(3), 269\u2013275 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"63_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M. Garey","year":"1980","unstructured":"Garey, M., Johnson, D., Miller, G., Papadimitriou, C.: The Complexity of Coloring Circular Arcs and Chords. SIAM Journal on Algebraic Discrete Methods\u00a01(2), 216\u2013227 (1980)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"1","key":"63_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/321864.321868","volume":"22","author":"E. Horowitz","year":"1975","unstructured":"Horowitz, E., Sahni, S.: On Computing the Exact Determinant of Matrices with Polynomial Entries. Journal of the ACM\u00a022(1), 38\u201350 (1975)","journal-title":"Journal of the ACM"},{"issue":"1","key":"63_CR7","first-page":"7","volume":"23","author":"A.V. Karzanov","year":"1987","unstructured":"Karzanov, A.V.: Maximum Matching of Given Weight in Complete and Complete Bipartite Graphs. Kibernetika\u00a023(1), 7\u201311 (1987) (English translation in CYBNAW 23(1), 8\u201313 (1987))","journal-title":"Kibernetika"},{"issue":"1-3","key":"63_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2003.12.001","volume":"143","author":"M. Mahajan","year":"2004","unstructured":"Mahajan, M., Subramanya, P.R., Vinay, V.: The Combinatorial Approach Yields an NC Algorithm for Computing Pfaffians. Discrete Applied Mathematics\u00a0143(1-3), 1\u201316 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An O(n 2.5) Algorithm for Maximum Matching in General Graphs. In: Proceedings Twenty-first Annual Symposium on the Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"issue":"1","key":"63_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as Easy as Matrix Inversion. Combinatorica\u00a07(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"issue":"1","key":"63_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1389-1286(02)00448-6","volume":"42","author":"C. Nomikos","year":"2003","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Satisfying a Maximum Number of Pre-Routed Requests in All-Optical Rings. Computer Networks\u00a042(1), 55\u201363 (2003)","journal-title":"Computer Networks"},{"key":"63_CR12","doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing Request Blocking in All-Optical Rings. In: Proceedings INFOCOM 2003, pp. 1771\u20131780 (2003)","DOI":"10.1109\/INFCOM.2003.1208971"},{"issue":"2","key":"63_CR13","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. Journal of the ACM\u00a029(2), 285\u2013309 (1982)","journal-title":"Journal of the ACM"},{"key":"63_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/195058.195119","volume-title":"Proceedings of the 26th Annual ACM Symposium on the Theory of Computing STOC 1994","author":"P. Raghavan","year":"1994","unstructured":"Raghavan, P., Upfal, E.: Efficient Routing in All-Optical Networks. In: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing STOC 1994, pp. 134\u2013143. ACM Press, New York (1994)"},{"key":"63_CR15","unstructured":"Stamoulis, G.: Maximum Matching Problems with Constraints (in Greek). Diploma Thesis, Department of Computer Science, University of Ioannina (2006)"},{"key":"63_CR16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","volume":"46","author":"P.-J. Wan","year":"1998","unstructured":"Wan, P.-J., Liu, L.: Maximal Throughput in Wavelength-Routed Optical Networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a046, 15\u201326 (1998)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"1-3","key":"63_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(01)00300-6","volume":"121","author":"T. Yi","year":"2002","unstructured":"Yi, T., Murty, K.G., Spera, C.: Matchings in Colored Bipartite Networks. Discrete Applied Mathematics\u00a0121(1-3), 261\u2013277 (2002)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:35:58Z","timestamp":1737365758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}