A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree

doi 10.1137/1.9781611975994.7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Analysis of Decision Tree for Diabetes Prediction

International Journal of Engineering and Technical Research (IJETR)
2019English

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2014English

Simultaneous Approximation by Greedy Algorithms

Advances in Computational Mathematics
Computational MathematicsApplied Mathematics
2006English

Decision Tree Analysis for Prostate Cancer Prediction

Srpski Arhiv Za Celokupno Lekarstvo
Medicine
2019English

Event Time Extraction With a Decision Tree of Neural Classifiers

Transactions of the Association for Computational Linguistics
2018English

Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2008English

The Greedy Prepend Algorithm for Decision List Induction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Uniform Approximation to Fourier Coefficients

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1953English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy