Pages that link to "Item:Q3467860"
From MaRDI portal
The following pages link to On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs (Q3467860):
Displaying 8 items.
- On residual approximation in solution extension problems (Q1631675) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Approximation algorithms for the scaffolding problem and its generalizations (Q2636507) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- Linearizing Genomes: Exact Methods and Local Search (Q3297780) (← links)
- On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs (Q3467860) (← links)
- Better Approximation Algorithms for Scaffolding Problems (Q4632165) (← links)
