scientific article; zbMATH DE number 1947052

MaRDI QIDQ4411282zbMATH OpenFDO

Authors Ganeshkumar Ganapathy, Tandy J. Warnow

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620122.htm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Trees (05C05) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Linear time 3-approximation for the MAST problem
• On the approximability of the maximum agreement subtree and maximum compatible tree problems
• Combinatorial Pattern Matching
• Computing and Combinatorics
• Maximum agreement and compatible supertrees

Cited in

(7)

• Linear time 3-approximation for the MAST problem
• Degrees of compatible \(L\)-subsets and compatible mappings.
• Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
• Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
• Maximum agreement and compatible supertrees
• On the approximability of the maximum agreement subtree and maximum compatible tree problems
• Finding a maximum compatible tree is NP-hard for sequences and trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411282)