Searching Trees: An Essay

DOI10.1007/978-3-642-02017-9_9MaRDI QIDQ3630190zbMATH OpenOpenAlexFDO

Authors Henning Fernau, Daniel Raible

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_9

Mathematics Subject Classification ID

History of computer science (68-03) Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• The analysis of heuristics for search trees
• scientific article; zbMATH DE number 53861
• Algorithms, random tree models and combinatorial objects
• Digital Search Trees Revisited
• On binary search trees

Cited in

(10)

• The analysis of heuristics for search trees
• A review of survival trees
• Computing the differential of a graph: hardness, approximability and exact algorithms
• Plug-and-play dual-tree algorithm runtime analysis
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
• Constraint bipartite vertex cover: simpler exact algorithms and implementations
• Charge and reduce: A fixed-parameter algorithm for string-to-string correction
• Searching a Tree with Permanently Noisy Advice
• A new upper bound for Max-2-SAT: A graph-theoretic approach
• Parameterized algorithms for d-hitting set: the weighted case

This page was built for publication: Searching Trees: An Essay

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