The following pages link to Computing and Combinatorics (Q5716929):
Displaying 8 items.
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
