Problem 39: Approximating Maximum Matching Size

From Open Problems in Sublinear Algorithms
Revision as of 01:53, 7 March 2013 by Krzysztof Onak (talk | contribs) (updated header)
Jump to: navigation, search
Suggested by Krzysztof Onak
Source Bertinoro 2011
Short link https://sublinear.info/39

Consider graphs with maximum degree bounded by $d$. It is possible to approximate the size of the maximum matching up to an additive $\epsilon n$ in time that is a function of only $\epsilon$ and $d$ [NguyenO-08,YoshidaYI-09]. The fastest currently known algorithm runs in $d^{O(1/\epsilon^2)}$ time [YoshidaYI-09].

Question: Is there an algorithm that runs in $\operatorname{poly}(d/\epsilon)$ time?

Retrieved from "https://sublinear.info/index.php?title=Open_Problems:39&oldid=650"