Browsing Combinatorics and Optimization by Subject "map"
Now showing items 1-2 of 2
-
The Matching Augmentation Problem: A 7/4-Approximation Algorithm
(University of Waterloo, 2019-05-23)We present a 7/4 approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected ... -
Transitive Factorizations of Permutations and Eulerian Maps in the Plane
(University of Waterloo, 2005)The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation with a specified cycle ...