Approximation Algorithms for Bounded Color Matchings via Convex Decompositions

Georgios Stamoulis. Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. In Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik, editors, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Volume 8635 of Lecture Notes in Computer Science, pages 625-636, Springer, 2014. [doi]

Abstract

Abstract is missing.