111 citations · 111 across the 2 of their papers we have counts for
2 papers
cs.DS2023
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
Costas Busch, Da Qi Chen, Arnold Filtser +3
A spanning tree of graph is a -approximate universal Steiner tree (UST) for root vertex if, for any subset of vertices containing , the cost of the minimal su…
cs.LG2017★ 111 cited
Near Optimal Behavior via Approximate State Abstraction
David Abel, D. Ellis Hershkowitz, Michael L. Littman
The combinatorial explosion that plagues planning and reinforcement learning (RL) algorithms can be moderated using state abstraction. Prohibitively large task representations can…