Homework Assignment 1

1
Homework Assignment 1

• Show the selection of the optimal DTD based on
  the MDL principle is NP-complete.
• Submit to ydchung_at_cs.kaist.ac.kr before the next
  class
• References
• XTRACT A System for Extracting Document Type
  Descriptors from XML Documents Minos
  Garofalakis, et. al. SIGMOD 2000.
• A Compendium of NP-complete problems,
  http//www.nada.kth.se/viggo/problemlist/compendi
  um.html
• M.R.Garey and D.S.Johnson, Computers and
  Intractability A guide to the theory of
  NP-completeness, Freeman Publishing Company,
  1976.
• Sara Baase, Computer Algorithms Introduction to
  design and analysis, Addison-Wesley, 1988