Pages that link to "Item:Q2576825"
From MaRDI portal
The following pages link to Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825):
Displaying 6 items.
- A practical exact algorithm for the individual haplotyping problem MEC/GI (Q848946) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- (Q5111282) (← links)
