Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph

Takimoto and Warmuth. "Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph." International Conference on Algorithmic Learning Theory, 1999. doi:10.1007/3-540-46769-6_28

[Takimoto and Warmuth. "Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph." International Conference on Algorithmic Learning Theory, 1999.](https://mlanthology.org/alt/1999/takimoto1999alt-predicting/) doi:10.1007/3-540-46769-6_28

@inproceedings{takimoto1999alt-predicting,
  title     = {{Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph}},
  author    = {Takimoto, Eiji and Warmuth, Manfred K.},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1999},
  pages     = {335-346},
  doi       = {10.1007/3-540-46769-6_28},
  url       = {https://mlanthology.org/alt/1999/takimoto1999alt-predicting/}
}