Pages that link to "Item:Q5901658"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901658):
Displaying 7 items.
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← 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)
