Pages that link to "Item:Q3602847"
From MaRDI portal
The following pages link to A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847):
Displaying 15 items.
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors (Q1361421) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- (Q3128905) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
