Pages that link to "Item:Q5136287"
From MaRDI portal
The following pages link to A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287):
Displaying 5 items.
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161) (← links)
- (Q4220474) (← links)
