Pages that link to "Item:Q2440161"
From MaRDI portal
The following pages link to Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161):
Displaying 8 items.
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Research on QoS service composition based on coevolutionary genetic algorithm (Q1626285) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- A strong designated verifier proxy re-signature scheme for IoT environments (Q2333880) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- (Q5140766) (← links)
