Improved approximation algorithm for convex recoloring of trees (Q927405): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: One for the price of two: a unified approach for approximating covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generating the N-ary Reflected Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing phylogenetic number to find good evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Evolutionary History From DNA Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Mutation Trees of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank

Latest revision as of 11:25, 28 June 2024

scientific article
Language Label Description Also known as
English
Improved approximation algorithm for convex recoloring of trees
scientific article

    Statements

    Identifiers