On two restricted ancestors tree problems

DOI10.1016/j.ipl.2010.05.002zbMath1234.68465OpenAlexW2094857032MaRDI QIDQ765480

Refael Hassin, Nili Guttmann-Beck

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.002

zbMATH Keywords

matroidapproximation algorithmsdirected minimum spanning tree

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree

Cites Work

• Unnamed Item
• Minimum perfect bipartite matchings and spanning trees under categorization
• Approximation algorithms for combinatorial problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The Complexity of Bottleneck Labeled Graph Problems
• A Greedy Heuristic for the Set-Covering Problem

This page was built for publication: On two restricted ancestors tree problems