ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1906.11385
  4. Cited By
A Tight Analysis of Greedy Yields Subexponential Time Approximation for
  Uniform Decision Tree
v1v2 (latest)

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

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019
26 June 2019
Ray Li
Abigail Z. Jacobs
Stephen Mussmann
ArXiv (abs)PDFHTML

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

3 / 3 papers shown
A Simple Approximation Algorithm for Optimal Decision Tree
A Simple Approximation Algorithm for Optimal Decision TreeOperations Research Letters (ORL), 2025
Zhengjia Zhuo
Viswanath Nagarajan
145
2
0
21 May 2025
Buying Information for Stochastic Optimization
Buying Information for Stochastic OptimizationInternational Conference on Machine Learning (ICML), 2023
Mingchen Ma
Christos Tzamos
229
1
0
06 Jun 2023
Approximating Pandora's Box with Correlations
Approximating Pandora's Box with CorrelationsInternational Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2021
Shuchi Chawla
Evangelia Gergatsouli
Jeremy McMahan
Christos Tzamos
256
16
0
30 Aug 2021
1
Page 1 of 1