Pages that link to "Item:Q621677"
From MaRDI portal
The following pages link to The simplified partial digest problem: approximation and a graph-theoretic model (Q621677):
Displaying 7 items.
- A fast algorithm for the partial digest problem (Q645279) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- The minimum distance superset problem: formulations and algorithms (Q1756748) (← links)
- Some necessary clarifications about the chords' problem and the partial digest problem (Q2576888) (← links)
- A new dynamic programming algorithm for the simplified partial digest problem (Q2697542) (← links)
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (Q5439390) (← links)
- LATIN 2004: Theoretical Informatics (Q5901658) (← links)