Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Fractional matching"”.
-
Competitive algorithms for online matching and vertex cover problems
… an explosion of research on the online bipartite matching problem. Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before. One of the motivation for studying this problem is that it significantly generalizes the classical ski rental problem. An …
-
Matching problems in hypergraphs
… 2} - {2n/3 choose 2}, then H contains a perfect matching. We show that for sufficiently large n divisible by 3, if F_1, ..., F_{n/3} are 3-uniform hypergraphs with a common vertex set and the minimum vertex degree in each F_i is greater than {(n-1) choose 2} - {2n/3 choose 2} for i = 1, ..., n/3, …