Practical approximation algorithms for zero- and bounded-skew trees

MaRDI QIDQ2768326zbMATH OpenFDO

Authors Ion Măndoiu, Alex Zelikovsky

Publication date 30 January 2002

zbMATH Keywords

approximation algorithmsrooted tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Practical approximation algorithms for zero- and bounded-skew trees
• Approximation algorithms for treewidth
• On treewidth approximations
• A subquadratic algorithm for constructing approximately optimal binary search trees
• An Approximation Algorithm for Binary Searching in Trees
• An approximation algorithm for binary searching in trees
• On Exact Algorithms for Treewidth
• Approximation algorithms for the bandwidth minimization problem for a large class of trees
• New lower bounds on the cost of binary search trees

Cited in

(7)

• Skew minimization problem with possible sink displacement
• Practical approximation algorithms for zero- and bounded-skew trees
• A tight lower bound for top-down skew heaps
• Skip-Splay: Toward Achieving the Unified Bound in the BST Model
• scientific article; zbMATH DE number 1305406 (Why is no real title available?)
• Minimizing Wirelength in Zero and Bounded Skew Clock Trees
• The derivation of a tighter bound for top-down skew heaps

This page was built for publication: Practical approximation algorithms for zero- and bounded-skew trees

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