Computing and Combinatorics
From MaRDI portal
Publication:5716929
DOI10.1007/11533719zbMath1128.68554OpenAlexW4376561447MaRDI QIDQ5716929
Vincent Berry, Sylvain Guillemot, Christophe Paul, François Nicolas
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Approximation algorithms (68W25)
Related Items (8)
An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees ⋮ An Improved Approximation Bound for Spanning Star Forest and Color Saving ⋮ Improved approximation algorithms for the spanning star forest problem ⋮ Improved approximation for spanning star forest in dense graphs ⋮ On Variants of the Spanning Star Forest Problem ⋮ Maximum agreement and compatible supertrees ⋮ On the star forest polytope for trees and cycles ⋮ On the approximability of the maximum agreement subtree and maximum compatible tree problems
This page was built for publication: Computing and Combinatorics
