An approximation algorithm for alphabet indexing problem (Q6487939): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/bfb0015403 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A machine discovery from amino acid sequences by decision trees over regular patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0015403 / rank
 
Normal rank

Latest revision as of 20:47, 30 December 2024

scientific article; zbMATH DE number 7666493
Language Label Description Also known as
English
An approximation algorithm for alphabet indexing problem
scientific article; zbMATH DE number 7666493

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references