Research on decision tree approximation withdrawn after submission

A recently withdrawn arXiv paper proposed a polynomial-time algorithm for approximating the uniform decision tree problem. The algorithm achieved an approximation ratio of less than 11.57, improving upon previous greedy methods. Its approach involved decomposing the optimal decision tree using techniques from hierarchical clustering and reducing subproblems to the Maximum Coverage problem. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

IMPACT This research, though withdrawn, explored algorithmic improvements relevant to decision-making processes in AI.

RANK_REASON The cluster contains a withdrawn academic paper detailing a new algorithmic approach.

Read on arXiv cs.LG →

• arXiv
• Michał Szyfelbein
• Decision Tree
• Hierarchical Clustering
• Maximum Coverage

• paper
• other