Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words

Hiroki Arimura, Shinichi Shimozono. Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. In Kyung-Yong Chwa, Oscar H. Ibarra, editors, Algorithms and Computation, 9th International Symposium, ISAAC 98, Taejon, Korea, December 14-16, 1998, Proceedings. Volume 1533 of Lecture Notes in Computer Science, pages 39-48, Springer, 1998. [doi]

@inproceedings{ArimuraS98,
  title = {Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words},
  author = {Hiroki Arimura and Shinichi Shimozono},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1533/15330039.htm},
  tags = {classification},
  researchr = {https://researchr.org/publication/ArimuraS98},
  cites = {0},
  citedby = {0},
  pages = {39-48},
  booktitle = {Algorithms and Computation, 9th International Symposium, ISAAC  98, Taejon, Korea, December 14-16, 1998, Proceedings},
  editor = {Kyung-Yong Chwa and Oscar H. Ibarra},
  volume = {1533},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-65385-6},
}